• 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 least number which is a perfect square and is divisible by each of the numbers 16, 20 and 24, is:

14400
6400
1600
3600

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F. and L.C.M. of two numbers are 12 and 5040 respectively If one of the numbers is 144, find the other number

420
110
360
180

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Product of 2 numbers = product of their HCF and LCM144 * x = 12 * 5040x = (12*5040)/144 = 420

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
2040
135
150

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Reduce 391/667 to lowest terms .

31/45
17/29
11/13
23/37

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

H.C.F. of 391 and 667 is 23.On dividing the numerator and denominator by 23, we get :391 = 391 ¸23 = 17667    667¸ 23    29

Problems on H.C.F and L.C.M
Find the lowest 4-digit number which when divided by 3, 4 or 5 leaves a remainder of 2 in each case?

1022
1030
1026
1020

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. Then sum of the number is:

10
20
40
30

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Let the numbers be 2x and 3x.Then, their L.C.M. = 6x.So, 6x = 48 or x = 8The numbers are 16 and 24.Hence, required sum = (16 + 24) = 40.

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
↑