• 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
The least number which should be added to 2497 so that sum is divisible by 5, 6, 4, 3?

27
21
23
25

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

LCM of 5,6,4,3 is 60.On dividing 2497 by 60 we get 37 as remainder.Therefore number to be added is 60 - 37 =23.

Problems on H.C.F and L.C.M
The H.C.F. and L.C.M. of two numbers are 12 and 5040 respectively If one of the numbers is 144, find the other number

110
360
180
420

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Product of 2 numbers = product of their HCF and LCM144 * x = 12 * 5040x = (12*5040)/144 = 420

Problems on H.C.F and L.C.M
Three numbers are in the ratio 3:4:5 and their L.C.M is 2400. Their H.C.F is:

40
80
200
120

ANSWER DOWNLOAD EXAMIANS APP

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?

4803
2403
3603
7203

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 m9nutes,how many times do they toll together ?

4
16
10
15

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The L.C.M. of two numbers is 48. The numbers are in the ratio 2:3. the sum of the numbers is:

64
28
32
40

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
↑