• 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
Let the least number of six digits,which when divided by 4,6,10 and 15 leaves in each case the same remainder of 2, be N. The sum of the digits in N is :

3
5
6
4

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the greatest number of four digits which when divided by 10, 15, 21 and 28 leaves 4, 9, 15 and 22 as remainders respectively?

9664
9654
9864
9666

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least multiple of 7, which leaves a remainder of 4, when divided by 6, 9, 15 and 18 is:

364
1045
777
1745

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

L.C.M. of 6, 9, 15 and 18 is 90.Let required number be 90k + 4, which is multiple of 7.Least value of k for which (90k + 4) is divisible by 7 is k = 4.Required number = (90 x 4) + 4 = 364.

Problems on H.C.F and L.C.M
What is the least number which when divided by 8, 12, 18 and 24 leaves the remainders 4, 8, 14 and 20 respectively?

78
68
None
58

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the L.C.M.. of 72, 108 and 2100.

37800
38000
37000
38600

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Four bells begin to toll together respectively at the intervals of 8, 10, 12 and 16 seconds. After how many seconds will they toll together again?

242 seconds
240 seconds
243 seconds
246 seconds

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
↑