• 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 of five digits which is exactly divisible by 12, 15 and 18, is:

10080
10010
10020
10015

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
What is the least number when divided by 4, 5, 6, 8 and 10 leaves 3 as remainder?

121
116
123
112

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 The least number which when divided by 4,5,6,8 and 10 is the LCM of these numbers. But each time  to get 3 as remainder, we have to add the remainder 3 to the obtained LCM.LCM of (4, 5, 6, 8, 10)+ 3=120+3=123

Problems on H.C.F and L.C.M
The ratio of two numbers is 3 : 4 and their H.C.F. is 4. Their L.C.M. is:

36
18
24
48

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Let the numbers be 3x and 4x. Then, their H.C.F. = x. So, x = 4.So, the numbers 12 and 16.L.C.M. of 12 and 16 = 48.

Problems on H.C.F and L.C.M
L.C.M. of two prime numbers x and y (x > y) is 161 The value of 3y – x is:

1
-1
2
-2

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number which when add 3 to it, completely divided 8, 12 and 18 is?

71
70
69
68

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The L.C.M. of two numbers is 45 times their H.C.F. If one of the numbers is 125 and the sum of H.C.F. and L.C.M. is 1150, the other number is:

215
235
220
225

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
↑