• 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:

15210
15110
15120
11115

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The smallest number when increased by " 1 " is exactly divisible by 12, 18, 24, 32 and 40 is:

1439
1440
1459
1449

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the H.C.F of 12, 16, 18 and 24?

1
4
2
3

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
51
47
45

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F. of two numbers is 11 and their L.C.M. is 693. If one of the numbers is 77,find the other.

99
79
89
109

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Other number = 11 X 693   = 99                              77                            

Problems on H.C.F and L.C.M
The L.C.M. of two numbers is 48. The numbers are in the ratio 2 : 3. Then sum of the number is:

10
30
40
20

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Let the numbers be 2x and 3x.Then, their L.C.M. = 6x.So, 6x = 48 or x = 8The numbers are 16 and 24.Hence, required sum = (16 + 24) = 40.

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
↑