• 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
Find the least number which when divided by 35 leaves remainder 25, when divided by 25 leaves remainder 15 and when divided by 15 leaves remainder 5?

435
420
515
518

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the greatest number that will divided 43,91 and 183 so as to leave the same remainder in each case

4
7
13
9

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F. of two numbers is 12 and their difference is 12. The numbers are:

66, 78
94, 106
70, 82
84, 96

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Four bells begin to toll together respectively at the intervals of 8, 10, 12 and 16 seconds. After how many seconds will they toll together again?

243 seconds
246 seconds
242 seconds
240 seconds

ANSWER DOWNLOAD EXAMIANS APP

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.

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

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
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
120/11
11/120

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
↑