• 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 number which, while dividing 19, 83 and 67, gives a remainder of 3 in each case?

16
19
17
18

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F of 2923 and 3239 is :

47
73
79
37

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. Then sum of the number is:

40
10
30
20

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Let the numbers be 2x and 3x.Then, their L.C.M. = 6x.So, 6x = 48 or x = 8The numbers are 16 and 24.Hence, required sum = (16 + 24) = 40.

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
420
360
180

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
The G.C.D. of 1.08, 0.36 and 0.9 is:

0.108
0.03
0.18
0.9

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 Given numbers are 1.08, 0.36 and 0.90.   H.C.F. of 108, 36 and 90 is 18, H.C.F. of given numbers = 0.18.

Problems on H.C.F and L.C.M
In finding the HCF of two numbers, the last divisor was 41 and the successive quotients, starting from the first, where 2, 4 and 2. The numbers are?

820,360
820,369
800,500
700,400

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
↑