• 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 least multiple of 23, which when divided by 18, 21 and 24 leaves remainders 7, 10 and 13 respectively.

3002
3013
3036
3024

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A heap of stones can be made up into groups of 21. When made up into groups of 16, 20, 25 and 45 there are 3 stones left in each case. How many stones at least can there be in the heap?

4803
3603
2403
7203

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Which of the following integers has the most number of divisors?

182
101
176
99

ANSWER DOWNLOAD EXAMIANS APP

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

10478
11340
12765
9720

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

The largest 4 digit number is 9999.We know that , if LCM of given numbers divide a number N , then N is exactly divisible by all the given numbers .LCM of 12,15,18,27 is 540.On dividing 9999 by 540 we get 279 as remainder.Therefore number =9999 - 279 =9720.

Problems on H.C.F and L.C.M
Find the least number which when divided by 35 leaves remainder 25, when divided by 25 leaves remainder 15 and when divided by 15 leaves remainder 5?

515
518
435
420

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the H.C.F of 54/9, 3 9/17 and 36/51?

17/6
17
6
6/153

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
↑