• 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
Least perfect square number, exactly divisible by 21, 36 and 56 is?

504
441
3600
7056

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
9985
9975
9957

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The maximum number of students among them 1001 pens and 910 pencils can be distributed in such a way that each student gets the same number of pens and same number of pencils is:

91
1001
1911
910

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
H.C.F of 4 * 27 * 3125, 8 * 9 * 25 * 7 and 16 * 81 * 5 * 11 * 49 is:

1260
360
180
540

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 ?

10
4
15
16

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
A heap of stones can be made up into groups of 21. When made up into groups of 16, 20, 25 and 45 there are 3 stones left in each case. How many stones at least can there be in the heap?

2403
3603
4803
7203

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
↑