• 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 is a perfect square and is divisible by each of the numbers 16, 20 and 24, is:

14400
1600
3600
6400

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Six bells commence tolling together and toll at the intervals of 2,4,6,8,10,12 seconds resp. In 60 minutes how many times they will toll together.

31
17
24
21

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

LCM of 2-4-6-8-10-12 is 120 seconds, that is 2 minutes.Now 60/2 = 30Adding one bell at the starting it will 30+1 = 31

Problems on H.C.F and L.C.M
Let the leas 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
3
6
4

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
H.C.F of 4 * 27 * 3125, 8 * 9 * 25 * 7 and 16 * 81 * 5 * 11 * 49 is:

180
1260
360
540

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A wholesale tea dealer 408 kilograms, 468 kilograms and 516 kilograms of three different qualities of tea. He wants it all to be packed into boxes of equal size without mixing. Find the capacity of th

24
12
50
36

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The L.C.M of two numbers is 495 and their H.C.F is 5. If the sum of the numbers is 10, then their difference is:

90
46
70
10

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
↑