• 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
14. The least number which when diminished by 7 is divisible by 21, 28, 36 and 45 is?

68
1265
1267
1261

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F. of two numbers is 11 and their L.C.M. is 7700. If one of the numbers is 275, then the other is:

208
508
408
308

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Other number = (11 x 7700/275) = 308.

Problems on H.C.F and L.C.M
If the product of two numbers is 84942 and their H.C.F. is 33, find their L.C.M.

2574
2474
2774
2674

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

HCF * LCM = 84942, because we knowProduct of two numbers = Product of HCF and LCMLCM = 84942/33 = 2574

Problems on H.C.F and L.C.M
The product of two numbers is 4107. If the H.C.F. of these numbers is 37, then the greater number is:

185
107
101
111

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 Let the numbers be 37a and 37b.Then, 37a x 37b = 4107 ab = 3.Now, co-primes with product 3 are (1, 3).So, the required numbers are (37 x 1, 37 x 3) i.e., (37, 111). Greater number = 111.

Problems on H.C.F and L.C.M
Find the greatest number which will divide 25, 73 and 97 as so to leave the same remainder in each case?

18
12
32
24

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?

24
56
60
48

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
↑