• 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 which can divide 1356,1868 and 2764 leaving the same remainder 12 in each case, is :

124
260
64
124

ANSWER DOWNLOAD EXAMIANS APP

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

18
17
16
19

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
Find the greatest possible length which can be used to measure exactly the length 4 m 95 cm . , 9 m and 16 m 65 cm.

45 cm.
35 cm
55 cm.
42 cm.

ANSWER DOWNLOAD EXAMIANS APP

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.

61
45
47
51

ANSWER DOWNLOAD EXAMIANS APP

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
A wholesale tea dealer 408 kilograms, 468 kilograms and 516 kilograms of three different qualities of tea. He wants it all to be packed into boxes of equal size without mixing. Find the capacity of th

24
12
36
50

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
↑