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

10
15
4
16

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the greatest number that will divided 43,91 and 183 so as to leave the same remainder in each case

9
13
7
4

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the largest number which divides 62,132,237 to leave the same reminder

None of these
35
25
30

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Trick is HCF of (237-132), (132-62), (237-62)= HCF of (70,105,175) = 35

Problems on H.C.F and L.C.M
A gardener was asked a plant flowers in a row containing equal number of plants. He tried to plant 6, 8, 10 and 12 in each row, but 5 plants left in each case. When he planted 13 in a row, no plant wa

845
125
245
485

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The product of two numbers is 2025 and their HCF is 15 their LCM is:

150
2010
135
2040

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the HCF of 54, 288, 360

16
18
17
19

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Lets solve this question by factorization method.18=2×3²,288=2×2×2×2×2×3²,360=2³×3²×5So HCF will be minimum term present in all three, i.e.2×3²=18

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
↑