• 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 greatest number which can divide 1356, 1868 and 2764 leaving the same remainder 12 in each case, is:

260
64
124
156

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
What is the greatest number which divides 29, 32, 38 and leaves same remainder in each case?

5
2
3
4

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The greatest possible length which can be used to measure exactly the lengths 7 m, 3 m 85 cm, 12 m 95 cm is:

35 cm
25 cm
45 cm
55 cm

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required length = H.C.F. of 700 cm, 385 cm and 1295 cm = 35 cm.

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

176
101
99
182

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
1095/1168 when expressed in simplest form is:

25/26
17/26
13/16
15/16

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Which of the following fractions is the largest?

63/80
31/40
13/16
7/8

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
↑