• 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, which when divided by 48, 60, 72, 108 and 140 leaves 38, 50, 62, 98 and 130 as remainders respectively, is:

11115
15210
15110
15120

ANSWER DOWNLOAD EXAMIANS APP

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

18
19
17
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

Problems on H.C.F and L.C.M
A heap of coconuts is divided into groups of 2, 3 and 5 and each time one coconut is left over. The least number of Coconuts in the heap is?

31
51
61
41

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
What is the least number which when divided by 5, 6, 7 and 8 leaves a remainder 3, but when divided by 9 leaves no remainder?

1650
1773
1683
1245

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A. B. and C. start at the same time in the same direction to run around a circular stadium. A completes a round in 252 seconds, B in 308 seconds and C in 198 seconds.all starting at the same point.

42 minutes 36 seconds
45 minutes
46 minutes 12 seconds.
26 minutes 18 seconds

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
HCF of 3/16, 5/12, 7/8 is:

1/48
5/48
3/47
2/47

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
↑