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

16
10
4
15

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F of two numbers is 8. Which of the following can never be their L.C.M?

24
60
48
56

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The greatest possible length which can be used to measure exactly the length 7m, 3m 85cm, 12 m 95 cm is

35 cm
15 cm
25 cm
42 cm

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the largest number of four digits which is exactly divisible by 27,18,12,15

9720
11720
10720
8720

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

LCM of 27-18-12-15 is 540.After dividing 9999 by 540 we get 279 remainder.So answer will be 9999-279 = 9720

Problems on H.C.F and L.C.M
Find the H.C.F of 204, 1190 and 1445?

85
204
34
17

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the smallest number of five digits exactly divisible by 16,24,36 and 54.

10268
10568
10468
10368

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Smallest number of five digits is 10000.       Required number must be divisible by L.C.M. of 16,24,36,54 i.e 432,       On dividing 10000 by 432,we get 64 as remainder.    Required number = 10000 +( 432 – 64 ) = 10368.

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
↑