• 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
Reduce 4128/4386 to its lowest terms

13/18
14/13
13/17
16/17

ANSWER DOWNLOAD EXAMIANS APP

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:

4
6
5
3

ANSWER DOWNLOAD EXAMIANS APP

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

182
101
99
176

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Option A, 176 = 1 x 2 x 2 x 2 x 2 x 11.Option B, 182 = 1 x 2 x 7 x 13. Option C, 99 = 1 x 3 x 3 x 11. Option D, 101 = 1 x 101.Divisors of 99 are 1, 3, 9, 11, 33, 99.Divisors of 176 are 1, 2, 4, 8, 11, 16, 22, 44, 88 and 176. Divisors of 182 are 1, 2, 7, 13, 14, 26, 91 and 182.Hence, 176 have the most number of divisors.

Problems on H.C.F and L.C.M
Find the greatest number that, while dividing 47, 215 and 365, gives the same remainder in each case?

3
4
6
5

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
9666
9654
9864

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number of four digits which is divisible by 15, 25, 40 and 75 is:

9400
9600
9800
9000

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
↑