• 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 that will divide 400, 435 and 541 leaving 9, 10 and 14 as remainders respectively

16
18
19
17

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

HCF of (400-9, 435-10, 541-14)HCF of (391, 425, 527) = 17

Problems on H.C.F and L.C.M
The product of the L.C.M. and H.C.F. of two numbers is 24. The difference of two numbers is 2. Find the numbers.

6 and 4
2 and 4
8 and 10
8 and 6

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The smallest number which when divided by 20, 25, 35 and 40 leaves a remainder of 14, 19, 29 and 34 respectively is?

1994
1349
1494
1496

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number which when divided by 5,6,7 And 8 leaves a remainder 3, but when divided by 9 leaves no remainder, is :

3363
1683
1677
2523

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
What is the greatest number which divides 29, 32, 38 and leaves same remainder in each case?

4
2
3
5

ANSWER DOWNLOAD EXAMIANS APP

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

133
131
129
127

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

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
↑