• 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 least number of five digits which is exactly divisible by 12,15 and 18 is :

10015
10010
10020
10080

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 NA

Problems on H.C.F and L.C.M
Find the least number which when divided by 6, 7, 8, 9 and 10 leaves 1, 2, 3, 4 and 5 as remainders respectively, but when divided by 19 leaves no remainder?

5016
5073
5054
5035

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Five bells ring together and ring at intervals of 2, 6, 8, 12 and 15 seconds respectively. How many times will they ring together in 60 minutes?

32
33
34
31

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the largest number which divides 62, 132 and 237 to leave the same remainder in each case.

48
35
52
22

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required number =  H.C.F. of (132 - 62), (237 - 132) and (237 - 62)                                      =  H.C.F. of 70, 105 and 175 = 35.

Problems on H.C.F and L.C.M
The greatest number which on dividing 1657 and 2037 leaves remainders 6 and 5 respectively, is:

125
127
128
126

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required number = H.C.F. of (1657 - 6) and (2037 - 5)= H.C.F. of 1651 and 2032 = 127.

Problems on H.C.F and L.C.M
The L.C.M. of two numbers is 48. The numbers are in the ratio 2:3. the sum of the numbers is:

32
64
40
28

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
↑