• 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 bells commence tolling together and toll at intervals of 2,4,6,8,10 and 12 seconds respectively. in 30 m9nutes,how many times do they toll together ?

4
10
16
15

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number of five digits which is exactly divisible by 12,15 and 18 is :

10080
10010
10015
10020

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 NA

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

8720
7720
6720
9720

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

The Largest number of four digits is 9999.       Required number must be divisible by L.C.M. of 12,15,18,27 i.e. 540.      On dividing 9999 by 540,we get 279 as remainder .   Required number = (9999-279) = 9720.

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?

68
1267
1261
1265

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F of two numbers is 8. Which of the following can never be their L.C.M?

48
60
24
56

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A room is 4 meters 37 cm long and 3 meters 23cm broad. It is required to pave the floor with minimum square slabs. Find the number of slabs required for this purpose?

431
391
381
485

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
↑