• 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
1095/1168 when expressed in simplest form is:

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

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The Smallest number which when diminished by 7, is divisible by 12,16,18,21 and 28 is :

1008
1022
1015
1032

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 12 and 5040 respectively If one of the numbers is 144, find the other number

180
360
420
110

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Product of 2 numbers = product of their HCF and LCM144 * x = 12 * 5040x = (12*5040)/144 = 420

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.

21
17
24
31

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, while dividing 19, 83 and 67, gives a remainder of 3 in each case?

17
18
16
19

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the HCF of 54, 288, 360

19
17
18
16

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Lets solve this question by factorization method.18=2×3²,288=2×2×2×2×2×3²,360=2³×3²×5So HCF will be minimum term present in all three, i.e.2×3²=18

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
↑