• 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
252 can be expressed as a product of primes as:

2 x 2 x 2 x 3 x 7
3 x 3 x 3 x 3 x 7
2 x 3 x 3 x 3 x 7
2 x 2 x 3 x 3 x 7

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Clearly, 252 = 2 x 2 x 3 x 3 x 7.

Problems on H.C.F and L.C.M
Two numbers are in the ratio of 15:11. If their H.C.F. is 13, find the numbers.

395, 343
195, 143
95, 43
295, 243

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Let the required numbers be 15.x and 11x.Then, their H.C.F. is x. So, x = 13.The numbers are (15 x 13 and 11 x 13) i.e., 195 and 143.

Problems on H.C.F and L.C.M
The greatest number of four digits that have 144 for their HCF is?

9903
9930
9935
9936

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The smallest number when increased by " 1 " is exactly divisible by 12, 18, 24, 32 and 40 is:

1459
1440
1439
1449

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the greatest number which on dividing 1661 and 2045, leaves a reminder of 10 and 13 respectively

129
131
127
133

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

In this type of question, its obvious we need to calculate the HCF, trick isHCF of (1661 - 10) and (2045 -13)= HCF (1651, 2032) = 127

Problems on H.C.F and L.C.M
The HCF of two numbers is 42 and the other two factors of their LCM are 11 and 12. What is the largest number.

450
480
504
462

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
↑