• 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 least number, which when divided by 48, 60, 72, 108 and 140 leaves 38, 50, 62, 98 and 130 as remainders respectively, is:

15210
15120
15110
11115

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find he smallest number of five digits exactly divisible by 16, 24, 36 and 54 .

9868
9368
10368
10688

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The smallest number which when diminished by 7, is divisible by 12, 16, 18, 21 and 28 is

1008
1022
1032
1015

ANSWER DOWNLOAD EXAMIANS APP

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 product of two digits number is 2160 and their HCF is 12. The numbers are:

(36,60)
(96,25)
(12,180)
(72,30)

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:

128
126
127
125

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required number = H.C.F. of (1657 - 6) and (2037 - 5)= H.C.F. of 1651 and 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
↑