• 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 product of two numbers is 1320 and their H.C.F. is 6. the L.C.M. of the numbers is:

1314
220
7920
1326

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the least which when divided y 16,18,20, and 25 leaves 4 as remainder in each case, but when divided by 7 leaves no remainder.

18002
18000
18004
17004

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Two numbers are in the ratio of 15 : 11. If their H.C. F. is 13, Find he numbers .

195 and 163
195 and 143
175 and 123
185 and 133

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The smallest number which when diminished by 7, is divisible 12, 16, 18, 21 and 28 is:

432
268
689
1015

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required number = (L.C.M. of 12,16, 18, 21, 28) + 7= 1008 + 7= 1015

Problems on H.C.F and L.C.M
Six bells commence tolling together and toll at intervals of 2, 4, 6, 8 10 and 12 seconds respectively. In 30 minutes, how many times do they toll together ?

4
15
16
10

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

L.C.M. of 2, 4, 6, 8, 10, 12 is 120. So, the bells will toll together after every 120 seconds(2 minutes). In 30 minutes, they will toll together 30 + 1 = 16 times. 2

Problems on H.C.F and L.C.M
14. The least number which when diminished by 7 is divisible by 21, 28, 36 and 45 is?

68
1265
1267
1261

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
↑