• 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 16, 18 and 21, leave the remainder 3, 5 and 8 respectively is:

1024
982
995
893

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The greatest number which can divide 1356,1868 and 2764 leaving the same remainder 12 in each case, is :

124
260
124
64

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?

123
121
116
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
The greatest possible length which can be used to measure exactly the length 7m, 3m 85cm, 12 m 95 cm is

42 cm
25 cm
15 cm
35 cm

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:

Cannot be calculated
equal to their H.
F
1
117

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A merchant has three different types of milk: 435 liters, 493 liters and 551 liters. Find the least number of casks of equal size required to store all the milk without mixing.

45
61
51
47

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
↑