• 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 product of two numbers is 2025 and their HCF is 15 their LCM is:

2040
135
2010
150

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The L.C.M. of two numbers is 48. The numbers are in the ratio 2:3. the sum of the numbers is:

64
28
32
40

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A rectangular courtyard 3.78 metres long and 2.25 metres wide is to be paved exactly with square title, all of the same size. What is the largest size of the tile which could be used for the purpose

21 cms
None of these
42 cms
11 cms

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the lowest common multiple of 24, 36 and 40.

120
240
360
480

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 2 | 24 - 36 - 40 -------------------- 2 | 12 - 18 - 20 -------------------- 2 | 6 - 9 - 10 ------------------- 3 | 3 - 9 - 5 ------------------- | 1 - 3 - 5 L.C.M. = 2 x 2 x 2 x 3 x 3 x 5 = 360.

Problems on H.C.F and L.C.M
The leas number which when divided by 5, 6, 7 and 8 leaves a remainder 3 but when divided by 9 leaves no remainder, is :

1683
3363
2523
1677

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the greatest number that will divide 400, 435 and 541 leaving 9, 10 and 14 as remainders respectively

19
17
16
18

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

HCF of (400-9, 435-10, 541-14)HCF of (391, 425, 527) = 17

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
↑