• 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
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 reciprocal of the numbers is equal to:

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

ANSWER DOWNLOAD EXAMIANS APP

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

Problems on H.C.F and L.C.M
LCM of 87 and 145 is:

875
48
435
1305

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the greatest number which is such that when 697, 909 and 1227 are divided by it, the remainders are all the same?

112
106
53
108

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
427
4320
859

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the smallest number of five digits exactly divisible by 16,24,36 and 54.

10568
10268
10468
10368

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Smallest number of five digits is 10000.       Required number must be divisible by L.C.M. of 16,24,36,54 i.e 432,       On dividing 10000 by 432,we get 64 as remainder.    Required number = 10000 +( 432 – 64 ) = 10368.

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
↑