• 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
Least perfect square number, exactly divisible by 21, 36 and 56 is?

7056
3600
441
504

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
68
None
58

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A, B and C start at the same time in the direction to run around a circular stadium. A completes a round in 252 seconds and C in 198 seconds, all starting at the same point. after what time will they

46 minutes 12 econds
45 minutes
26 minutes 18 econds
42 minutes 36 econds

ANSWER DOWNLOAD EXAMIANS APP

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:

548
216
389
443

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

1600
14400
3600
6400

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number which should be added to 2497 so that sum is divisible by 5, 6, 4, 3?

27
21
25
23

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

LCM of 5,6,4,3 is 60.On dividing 2497 by 60 we get 37 as remainder.Therefore number to be added is 60 - 37 =23.

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
↑