• 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
What is the greatest number which divides 29, 32, 38 and leaves same remainder in each case?

3
2
4
5

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
HCF of 3/16, 5/12, 7/8 is:

2/47
3/47
5/48
1/48

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?

124
96
117
110

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the largest number of four digits exactly divisible by 12,15,18 and 27.

6720
7720
9720
8720

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

The Largest number of four digits is 9999.       Required number must be divisible by L.C.M. of 12,15,18,27 i.e. 540.      On dividing 9999 by 540,we get 279 as remainder .   Required number = (9999-279) = 9720.

Problems on H.C.F and L.C.M
The least number, which when divided by 12, 15, 20 and 54 leaves in each case a remainder of 8 is:

216
389
443
548

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required number = (L.C.M. of 12, 15, 20, 54) + 8= 540 + 8= 548.

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 :

5
6
4
3

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
↑