• 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
Three numbers are in the ratio 1 : 2 : 3 and their H.C.F is 12. The numbers are

5, 10, 15
10, 20, 30
4, 8, 12
12, 24, 36

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number, which when divided by 48, 60, 72, 108 and 140 leaves 38, 50, 62, 98 and 130 as remainders respectively, is:

11115
15110
15210
15120

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A wholesale tea dealer 408 kilograms, 468 kilograms and 516 kilograms of three different qualities of tea. He wants it all to be packed into boxes of equal size without mixing. Find the capacity of th

12
50
36
24

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.

10468
10568
10268
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.

Problems on H.C.F and L.C.M
H.C.F of 4 x 27 x 3125, 8 x 9 x 25 x 7 and 16 x 81 x 5 x 11 x 49 is

540
180
360
1260

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
185 and 133
175 and 123
195 and 143

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
↑