• 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 are in the ratio 3 : 4. If their L.C.M. is 96. what is sum of the numbers?

48
76
84
56

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
What is the least number which when divided by 5, 6, 7 and 8 leaves a remainder 3, but when divided by 9 leaves no remainder?

1650
1773
1683
1245

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the largest number which divides 62, 132 and 237 to leave the same remainder in each case.

35
52
48
22

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required number =  H.C.F. of (132 - 62), (237 - 132) and (237 - 62)                                      =  H.C.F. of 70, 105 and 175 = 35.

Problems on H.C.F and L.C.M
Find the HCF of 54, 288, 360

19
18
16
17

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Lets solve this question by factorization method.18=2×3²,288=2×2×2×2×2×3²,360=2³×3²×5So HCF will be minimum term present in all three, i.e.2×3²=18

Problems on H.C.F and L.C.M
Find the largest number which divides 62,132,237 to leave the same reminder

25
None of these
35
30

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Trick is HCF of (237-132), (132-62), (237-62)= HCF of (70,105,175) = 35

Problems on H.C.F and L.C.M
The greatest number which can divide 1356, 1868 and 2764 leaving the same remainder 12 in each case, is:

156
124
260
64

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
↑