• 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
18
17
19

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
How many minimum number's of whole square slabs are required for paving the floor 12.96 meters long and 3.84 meters side?

256
108
192
216

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number, which when divided by 48, 60, 72, 108 and 140 leaves 38, 0, 62,98 and 130 as remainders respectively is .

15110
15210
11115
15120

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The greatest number which on dividing 1657 and 2037 leaves remainders 6 and 5 respectively, is:

125
128
126
127

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required number = H.C.F. of (1657 - 6) and (2037 - 5)= H.C.F. of 1651 and 2032 = 127.

Problems on H.C.F and L.C.M
The greatest number which can divide 1356, 1868 and 2764 leaving the same remainder 12 in each case, is:

64
124
156
260

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
10
30
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.

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
↑