• 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
The L.C.M of two numbers is 495 and their H.C.F is 5. If the sum of the numbers is 10, then their difference is:

70
10
90
46

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number, which when divided by 48, 60, 72, 108 and 140 leaves 38, 0, 62,98 and 130 as remainders respectively is .

11115
15110
15120
15210

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
23
21

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 H.C.F of 204, 1190 and 1445 is:

21
17
18
19

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
276
322
345

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
In finding the HCF of two numbers, the last divisor was 41 and the successive quotients, starting from the first, where 2, 4 and 2. The numbers are?

820,369
820,360
800,500
700,400

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
↑