• 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
A man was employed on the promise that he will be paid the highest wages per day. The contract money to be paid was Rs. 1189. Finally he was paid only Rs. 1073. For how many days did he actually work?

37
40
35
39

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the least multiple of 23, which when divided by 18, 21 and 24 leaves remainders 7, 10 and 13 respestively.

3024
3036
3002
3013

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The sum of two numbers is 528 and their H.C.F is 33. The number of pairs of numbers satisfying the above condition is

6
8
12
4

ANSWER DOWNLOAD EXAMIANS APP

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

1183
1683
1383
1983

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

L.C.M. of 5, 6, 7, 8 = 840.Required number is of the form 840k + 3Least 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
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
508
308
208

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

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

Problems on H.C.F and L.C.M
Find the L.C.M.. of 72, 108 and 2100.

38000
37800
37000
38600

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
↑