• 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 maximum number of student amoung them 1001 pens and 910 pencils can be distributed in such a way that each student gets the same number of pens and same number of pencils is :

910
1911
1001
91

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
What is the least number which when divided by 6, 9, 12 and 18 leaves remainder 4 in each care?

36
56
40
30

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the least number which when divided by 6, 7, 8, 9 and 10 leaves 1, 2, 3, 4 and 5 as remainders respectively, but when divided by 19 leaves no remainder?

5016
5073
5054
5035

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Three number are in the ratio of 3 : 4 : 5 and their L.C.M. is 2400. Their H.C.F. is:

40
80
120
200

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 Let the numbers be 3x, 4x and 5x.Then, their L.C.M. = 60x.So, 60x = 2400 or x = 40. The numbers are (3 x 40), (4 x 40) and (5 x 40).Hence, required H.C.F. = 40.

Problems on H.C.F and L.C.M
What is the lowest common multiple of 12, 36 and 40?

260
360
380
240

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
↑