• 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
4
15
10

ANSWER DOWNLOAD EXAMIANS APP

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

260
360
240
380

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
37
42

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number which when increased by 5 each divisible by each one of 24, 32, 36 and 54 is :

4320
859
427
869

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the lowest common multiple of 24, 36 and 40.

480
120
360
240

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 2 | 24 - 36 - 40 -------------------- 2 | 12 - 18 - 20 -------------------- 2 | 6 - 9 - 10 ------------------- 3 | 3 - 9 - 5 ------------------- | 1 - 3 - 5 L.C.M. = 2 x 2 x 2 x 3 x 3 x 5 = 360.

Problems on H.C.F and L.C.M
There are four prime numbers written in ascending order of magnitude. The product of the first three is 7429 and of the last three is 12673. Find the fourth number?

17
31
23
29

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
↑