• 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
What is the lowest common multiple of 12, 36 and 40?

240
380
260
360

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
There are four prime numbers written in ascending order of magnitude. The product of the first three is 7429 and of the last three is 12673. Find the fourth number?

29
31
23
17

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the least multiple of 23, which when divided by 18, 21 and 24 leaves remainders 7, 10 and 13 respestively.

3002
3013
3036
3024

ANSWER DOWNLOAD EXAMIANS APP

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

101
176
182
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.

Problems on H.C.F and L.C.M
The least number, which when divided by 48, 60, 72, 108 and 140 leaves 38, 50, 62, 98 and 130 as remainders respectively, is:

15110
15210
15120
11115

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The product of two numbers is 2025 and their HCF is 15 their LCM is:

2010
135
150
2040

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
↑