• 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
The greatest number of five digits which is divisible by 32, 36, 40, 42 and 48 is:

90720
90730
90725
90715

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The largest four – digit number which when divided by 4, 7 or 13 leaves a remainder of 3 in each case, is

8739
9831
9893
9834

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Product of two co-prime numbers is 117. Their L.C.M should be:

117
Cannot be calculated
F
1
equal to their H.

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
If LCM of two number is 693, HCF of two numbers is 11 and one number is 99, then find other

55
88
77
66

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Product of two numbers = Product of their HCF and LCMSo Other number =(693×11/99)                              = 77

Problems on H.C.F and L.C.M
Find the largest number of four digits exactly divisible by 12,15,18 and 27.

8720
6720
7720
9720

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

The Largest number of four digits is 9999.       Required number must be divisible by L.C.M. of 12,15,18,27 i.e. 540.      On dividing 9999 by 540,we get 279 as remainder .   Required number = (9999-279) = 9720.

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?

1494
1496
1349
1994

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
↑