• 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
Let the least number of six digits, which when divided by 4, 6, 10 and 15, leaves in each case the same remainder of 2, be N. The sum of the digits in N is:

3
5
6
4

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Three numbers are in the ratio 1 : 2 : 3 and their H.C.F is 12. The numbers are

4, 8, 12
10, 20, 30
5, 10, 15
12, 24, 36

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the smallest number of five digits exactly divisible by 16,24,36 and 54.

10468
10268
10368
10568

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Smallest number of five digits is 10000.       Required number must be divisible by L.C.M. of 16,24,36,54 i.e 432,       On dividing 10000 by 432,we get 64 as remainder.    Required number = 10000 +( 432 – 64 ) = 10368.

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. The sum of numbers is:

32
40
28
64

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F. of 0.54, 1.8 and 7.2 is:

18
1.8
0.18
0.018

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A room is 6 meters 24 centimeters in length and 4 meters 32 centimeters in width. Find the least number of square tiles of equal size required to cover the entire floor of the room?

117
110
96
124

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
↑