• 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 multiple of 23, which when divided by 18, 21 and 24 leaves remainders 7, 10 and 13 respectively.

3013
3024
3036
3002

ANSWER DOWNLOAD EXAMIANS APP

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:

10010
10020
10015
10080

ANSWER DOWNLOAD EXAMIANS APP

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

30
35
25
None of these

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Trick is HCF of (237-132), (132-62), (237-62)= HCF of (70,105,175) = 35

Problems on H.C.F and L.C.M
Find the greatest 4-digit number exactly divisible by 3, 4 and 5?

9975
9985
9957
9960

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
An officer was appointed on maximum daily wages on contract money of Rs. 4956. But on being absent for some days, he was paid only Rs. 3894. For how many days was he absent?

4
5
3
6

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
21
24
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

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
↑