• 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
What will be the LCM of 8, 24, 36 and 54

112
216
345
444

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

LCM of 8-24-36-54 will be2*2*2*3*3*3 = 216

Problems on H.C.F and L.C.M
A man was employed on the promise that he will be paid the highest wages per day. The contract money to be paid was Rs. 1189. Finally he was paid only Rs. 1073. For how many days did he actually work?

37
40
35
39

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The greatest number of five digits which is divisible by 32, 36, 40, 42 and 48 is:

90720
90725
90715
90730

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F. of two numbers is 11 and their L.C.M. is 7700. If one of the numbers is 275, then the other is:

408
508
208
308

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Other number = (11 x 7700/275) = 308.

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

24
50
12
36

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number, which when divided by 12, 15, 20 and 54 leaves in each case a remainder of 8 is:

443
389
548
216

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required number = (L.C.M. of 12, 15, 20, 54) + 8= 540 + 8= 548.

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
↑