• 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 13 which when divided by 6, 8 and 12 leaves 5, 7 and 11 as remainders respectively?

143
221
260
169

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
What is the least number when divided by 4, 5, 6, 8 and 10 leaves 3 as remainder?

116
123
121
112

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 The least number which when divided by 4,5,6,8 and 10 is the LCM of these numbers. But each time  to get 3 as remainder, we have to add the remainder 3 to the obtained LCM.LCM of (4, 5, 6, 8, 10)+ 3=120+3=123

Problems on H.C.F and L.C.M
Find the size of the largest square slabs which can be paved on the floor of a room 5 meters 44 cm long and 3 meters 74 cm broad?

34
56
38
42

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the greatest number which is such that when 697, 909 and 1227 are divided by it, the remainders are all the same?

106
108
53
112

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
9834
9893
9831

ANSWER DOWNLOAD EXAMIANS APP

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.

3036
3002
3013
3024

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
↑