• 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 H.C.F of 54/9, 3 9/17 and 36/51?

6
17
17/6
6/153

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Three men start together to travel the same way around a circular track of 11 kilometers in circumference. Their speeds are 4, 5 and 8 kilometers per hour respectively. When will they meet at a starti

220 hours
11 hours
22 hours
12 hours

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Three numbers are in the ratio of 2 : 3 : 4 and their L.C.M. is 240. Their H.C.F. is:

60
20
40
30

ANSWER DOWNLOAD EXAMIANS APP

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

9600
9400
9000
9800

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
64
124
260

ANSWER DOWNLOAD EXAMIANS APP

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

101
182
176
99

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.

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
↑