• 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
The least number, which when divided by 12, 15, 20 and 54 leaves in each case a remainder of 8 is:

443
548
389
216

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

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

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:

124
260
156
64

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A drink vendor has 80 liters of Maaza, 144 liters of Pepsi and 368 liters of Sprite. He wants to pack them in cans, so that each can contains the same number of liters of a drink, and doesn't want to

30
35
42
37

ANSWER DOWNLOAD EXAMIANS APP

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

9620
8760
8720
9720

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
What is the lowest common multiple of 12, 36 and 40?

360
240
260
380

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
What is the least number when divided by 4, 5, 6, 8 and 10 leaves 3 as remainder?

121
116
112
123

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 The least number which when divided by 4,5,6,8 and 10 is the LCM of these numbers. But each time  to get 3 as remainder, we have to add the remainder 3 to the obtained LCM.LCM of (4, 5, 6, 8, 10)+ 3=120+3=123

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
↑