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

37
30
35
42

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A heap of coconuts is divided into groups of 2, 3 and 5 and each time one coconut is left over. The least number of Coconuts in the heap is?

61
31
51
41

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the greatest 4-digit number exactly divisible by 3, 4 and 5?

9960
9957
9975
9985

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
14. The least number which when diminished by 7 is divisible by 21, 28, 36 and 45 is?

1261
68
1267
1265

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Six bells 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 ?

4
16
10
15

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

L.C.M. of 2, 4, 6, 8, 10, 12 is 120. So, the bells will toll together after every 120 seconds(2 minutes). In 30 minutes, they will toll together 30 + 1 = 16 times. 2

Problems on H.C.F and L.C.M
L.C.M. of two prime numbers x and y (x > y) is 161 The value of 3y – x is:

-1
-2
2
1

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
↑