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

15
16
10
4

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Which of the following has the most number of divisors?

101
176
99
182

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Option A, 176 = 1 x 2 x 2 x 2 x 2 x 11.Option B, 182 = 1 x 2 x 7 x 13. Option C, 99 = 1 x 3 x 3 x 11. Option D, 101 = 1 x 101.Divisors of 99 are 1, 3, 9, 11, 33, 99.Divisors of 176 are 1, 2, 4, 8, 11, 16, 22, 44, 88 and 176. Divisors of 182 are 1, 2, 7, 13, 14, 26, 91 and 182.Hence, 176 have the most number of divisors.

Problems on H.C.F and L.C.M
LCM of 18 and 27 is:

89
85
54
91

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the greatest number which will divide 25, 73 and 97 as so to leave the same remainder in each case?

18
24
12
32

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:

215
235
225
220

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The largest four – digit number which when divided by 4, 7 or 13 leaves a remainder of 3 in each case, is

9831
8739
9893
9834

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
↑