• HOME
  • QUIZ
  • CONTACT US
EXAMIANS
  • COMPUTER
  • CURRENT AFFAIRS
  • ENGINEERING
    • Chemical Engineering
    • Civil Engineering
    • Computer Engineering
    • Electrical Engineering
    • Mechanical Engineering
  • ENGLISH GRAMMAR
  • GK
  • GUJARATI MCQ

Problems on H.C.F and L.C.M

Problems on H.C.F and L.C.M
Two numbers 4242 and 2903 when divided by a certain number of three digits, leave the same remainder. Find the number?

103
107
113
101

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number which should be added to 2497 so that the sum is exactly divisible by 5, 6, 4 and 3 is:

24
22
21
23

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

L.C.M. of 5, 6, 4 and 3 = 60. On dividing 2497 by 60, the remainder is 37.Number to be added = (60 - 37) = 23.

Problems on H.C.F and L.C.M
The smallest number when increased by " 1 " is exactly divisible by 12, 18, 24, 32 and 40 is:

1449
1440
1439
1459

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Product of two co-prime numbers is 117. Their L.C.M should be:

equal to their H.
1
F
117
Cannot be calculated

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F. of two numbers is 23 and the other two factors of their L.C.M. are 13 and 14. The larger of the two numbers is:

299
345
276
322

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Clearly, the numbers are (23 x 13) and (23 x 14). Larger number = (23 x 14) = 322.

Problems on H.C.F and L.C.M
The product of the L.C.M. and H.C.F. of two numbers is 24. The difference of two numbers is 2. Find the numbers.

8 and 6
6 and 4
2 and 4
8 and 10

ANSWER DOWNLOAD EXAMIANS APP
MORE MCQ ON Problems on H.C.F and L.C.M

DOWNLOAD APP

  • APPLE
    from app store
  • ANDROID
    from play store

SEARCH

LOGIN HERE


  • GOOGLE

FIND US

  • 1.70K
    FOLLOW US
  • EXAMIANSSTUDY FOR YOUR DREAMS.
  • SUPPORT :SUPPORT EMAIL ACCOUNT : examians@yahoo.com

OTHER WEBSITES

  • GUJARATI MCQ
  • ACCOUNTIANS

QUICK LINKS

  • HOME
  • QUIZ
  • PRIVACY POLICY
  • DISCLAIMER
  • TERMS & CONDITIONS
  • CONTACT US
↑