• 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
LCM of 18 and 27 is:

91
54
85
89

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:

1183
1983
1383
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.

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 ?

15
16
4
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
Find the H.C.F of 12, 16, 18 and 24?

3
2
1
4

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The L.C.M. of two numbers is 45 times their H.C.F. If one of the numbers is 125 and the sum of H.C.F. and L.C.M. is 1150, the other number is:

220
235
225
215

ANSWER DOWNLOAD EXAMIANS APP

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 :

260
124
124
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
↑