• 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 on dividing 1661 and 2045, leaves a reminder of 10 and 13 respectively

131
127
129
133

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

In this type of question, its obvious we need to calculate the HCF, trick isHCF of (1661 - 10) and (2045 -13)= HCF (1651, 2032) = 127

Problems on H.C.F and L.C.M
Find the greatest number that will divided 43,91 and 183 so as to leave the same remainder in each case

7
4
13
9

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Reduce 4128/4386 to its lowest terms

13/17
13/18
14/13
16/17

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:

20
30
10
40

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 least number which when add 3 to it, completely divided 8, 12 and 18 is?

68
69
71
70

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A wholesale tea dealer 408 kilograms, 468 kilograms and 516 kilograms of three different qualities of tea. He wants it all to be packed into boxes of equal size without mixing. Find the capacity of th

50
24
12
36

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
↑