• 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 HCF of 2.1, 1.05 and 0.63

3.21
2.21
0.21
1.21

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

To solve this question quickly, first remove decimal by multiplying each term with 100,Then terms become 210, 105, 63Then HCF of above terms is 21, So Answer is 0.21

Problems on H.C.F and L.C.M
Find the least multiple of 23, which when divided by 18, 21 and 24 leaves remainders 7, 10 and 13 respestively.

3002
3013
3036
3024

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the least which when divided y 16,18,20, and 25 leaves 4 as remainder in each case, but when divided by 7 leaves no remainder.

17004
18004
18002
18000

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Two numbers are in the ratio 3 : 4. If their L.C.M. is 96. what is sum of the numbers?

48
76
56
84

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number which should be added to 2497 so that the sum is exactly divisible by 5, 6, 4 and 3 is:

24
23
21
22

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

L.C.M. of 5, 6, 4 and 3 = 60. On dividing 2497 by 60, the remainder is 37.Number to be added = (60 - 37) = 23.

Problems on H.C.F and L.C.M
The least number which when increased by 5 each divisible by each one of 24, 32, 36 and 54 is :

859
4320
869
427

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
↑