• 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 greatest number of five digits which is divisible by 32, 36, 40, 42 and 48 is:

90730
90720
90715
90725

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
1095/1168 when expressed in simplest form is:

13/16
25/26
17/26
15/16

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F and L.C.M of two numbers are 84 and 21 respectively. If the ratio of the two numbers is 1 : 4 , then the larger of the two numbers is

48
108
12
84

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
If the product of two numbers is 84942 and their H.C.F. is 33, find their L.C.M.

2474
2774
2574
2674

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

HCF * LCM = 84942, because we knowProduct of two numbers = Product of HCF and LCMLCM = 84942/33 = 2574

Problems on H.C.F and L.C.M
Six bells commence tolling together and toll at intervals of 2,4,6,8,10 and 12 seconds respectively. in 30 m9nutes,how many times do they toll together ?

4
15
10
16

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.

17
24
31
21

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
↑