• 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
A merchant has three different types of milk: 435 liters, 493 liters and 551 liters. Find the least number of casks of equal size required to store all the milk without mixing.

47
45
61
51

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The G.C.D. of 1.08, 0.36 and 0.9 is:

0.03
0.9
0.18
0.108

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 Given numbers are 1.08, 0.36 and 0.90.   H.C.F. of 108, 36 and 90 is 18, H.C.F. of given numbers = 0.18.

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 remainder respectively, is :

15120
15210
11115
15110

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

35
25
30
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 number that will divide 400, 435 and 541 leaving 9, 10 and 14 as remainders respectively

17
18
19
16

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

HCF of (400-9, 435-10, 541-14)HCF of (391, 425, 527) = 17

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?

41
61
31
51

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
↑