• 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 increased by 5 is divisible by each one of 24, 32, 36 and 54, is

427
859
869
4320

ANSWER DOWNLOAD EXAMIANS APP

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:

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

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 :

1022
1032
1008
1015

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
What will be the LCM of 8, 24, 36 and 54

345
112
444
216

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

LCM of 8-24-36-54 will be2*2*2*3*3*3 = 216

Problems on H.C.F and L.C.M
Find the least number which when divided by 6,7,8,9, and 12 leave the same remainder 1 each case

707
404
606
505

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

  3 |  6 - 7  - 8  - 9 - 12-----------------------------  4 | 2  - 7  - 8  - 3 - 4  ---------------------------   2 | 2  - 7  - 2  - 3 - 1 --------------------------     | 1  - 7  - 1  - 3 - 1 L.C.M = 3 X 2 X 2 X 7 X 2 X 3 = 504.Hence required number = (504 +1) = 505   

Problems on H.C.F and L.C.M
In finding the HCF of two numbers, the last divisor was 41 and the successive quotients, starting from the first, where 2, 4 and 2. The numbers are?

820,369
820,360
800,500
700,400

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
↑