• 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
The L.C.M. of two numbers is 45 times their H.C.F. If one of the numbers is 125 and the sum of H.C.F. and L.C.M. is 1150, the other number is:

225
220
235
215

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Six bells commence tolling together and toll at the intervals of 2,4,6,8,10,12 seconds resp. In 60 minutes how many times they will toll together.

31
24
21
17

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

LCM of 2-4-6-8-10-12 is 120 seconds, that is 2 minutes.Now 60/2 = 30Adding one bell at the starting it will 30+1 = 31

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?

53
112
106
108

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number which is a perfect square and is divisible by each of the numbers 16,20, and 24, is :

1600
3600
6400
11400

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 :

1677
3363
2523
1683

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 conditions is:

4
6
12
8

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
↑