• 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
Which of the following integers has the most number of divisors?

182
176
101
99

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F. of two numbers is 11 and their L.C.M. is 7700. If one of the numbers is 275, then the other is:

408
208
308
508

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Other number = (11 x 7700/275) = 308.

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 :

2523
1677
3363
1683

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number which when increased by 5 is divisible by each one of 24, 32, 36 and 54, is

869
4320
859
427

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the least number which when divided by 5,6,7, and 8 leaves a remainder 3, but when divided by 9 leaves no remainder .

1683
2683
3683
4683

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

L.C.M. of 5,6,7,8 = 840.    Required number is of the form 840k + 3     Least value of k for which (840k + 3) is divisible by 9 is k = 2. Required number = (840 X 2 + 3)=1683

Problems on H.C.F and L.C.M
If the sum of two numbers is 55 and the H.C.F. and L.C.M. of these numbers are 5 and 120 respectively, then the sum of the reciprocals of the numbers is equal to:

601/55
55/601
11/120
120/11

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
↑