• 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?

221
143
260
169

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A gardener was asked a plant flowers in a row containing equal number of plants. He tried to plant 6, 8, 10 and 12 in each row, but 5 plants left in each case. When he planted 13 in a row, no plant wa

845
125
485
245

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:

equal to their H.
1
F
Cannot be calculated
117

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number which when divided by 8, 12 and 16, leave in each remainder 3, is?

69
70
51
71

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A rectangular courtyard 3.78 meters long 5.25 meters wide is to be paved exactly with square tiles, all of the same size. what is the largest size of the tile which could be used for the purpose?

42 cms
21 cms
None of these
14 cms

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number, which when divided by 12, 15, 20 and 54 leaves in each case a remainder of 8 is:

389
443
216
548

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required number = (L.C.M. of 12, 15, 20, 54) + 8= 540 + 8= 548.

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
↑