• 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
Find the greatest 4-digit number exactly divisible by 3, 4 and 5?

9957
9960
9985
9975

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The greatest possible length which can be used to measure exactly the length 7m, 3m 85cm, 12 m 95 cm is

42 cm
15 cm
25 cm
35 cm

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Let the least number of six digits, which when divided by 4, 6, 10 and 15, leaves in each case the same remainder of 2, be N. The sum of the digits in N is:

5
4
6
3

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the L.C.M of 2/15, 3/10, 6/5

8/5
2/3
7/5
6/5

ANSWER DOWNLOAD EXAMIANS APP

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.

2774
2474
2674
2574

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
Find the least number which when divided by 5,6,7, and 8 leaves a remainder 3, but when divided by 9 leaves no remainder .

4683
1683
3683
2683

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

L.C.M. of 5,6,7,8 = 840.    Required number is of the form 840k + 3     Least value of k for which (840k + 3) is divisible by 9 is k = 2. Required number = (840 X 2 + 3)=1683

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
↑