• 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
Six belts 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 ?

10
4
16
15

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F. of 1.75, 5.6 and 7 is:

3.5
0.35
0.07
0.7

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the H.C.F of 12, 16, 18 and 24?

4
2
1
3

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The greatest number which on dividing 1657 and 2037 leaves remainders 6 and 5 respectively, is:

125
126
127
128

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required number = H.C.F. of (1657 - 6) and (2037 - 5)= H.C.F. of 1651 and 2032 = 127.

Problems on H.C.F and L.C.M
A heap of stones can be made up into groups of 21. When made up into groups of 16, 20, 25 and 45 there are 3 stones left in each case. How many stones at least can there be in the heap?

7203
4803
3603
2403

ANSWER DOWNLOAD EXAMIANS APP

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

1983
1383
1183
1683

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

L.C.M. of 5, 6, 7, 8 = 840.Required number is of the form 840k + 3Least value of k for which (840k + 3) is divisible by 9 is k = 2.Required number = (840 x 2 + 3) = 1683.

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
↑