• 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 16, 18 and 21, leave the remainder 3, 5 and 8 respectively is:

982
893
995
1024

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the L.C.M.. of 72, 108 and 2100.

37000
38000
38600
37800

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.

8720
7720
6720
9720

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
A rectangular courtyard 3.78 meters long 5.25 meters wide is to be paved exactly with square tiles, all of the same size. what is the largest size of the tile which could be used for the purpose?

None of these
21 cms
42 cms
14 cms

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
What is the least number which when divided by 8, 12, 18 and 24 leaves the remainders 4, 8, 14 and 20 respectively?

78
58
None
68

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Five bells ring together and ring at intervals of 2, 6, 8, 12 and 15 seconds respectively. How many times will they ring together in 60 minutes?

33
34
32
31

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
↑