• 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 greatest possible length which can be used to measure exactly the length 7m, 3m 85cm, 12 m 95 cm is

42 cm
25 cm
35 cm
15 cm

ANSWER DOWNLOAD EXAMIANS APP

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
6400
3600
11400

ANSWER DOWNLOAD EXAMIANS APP

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

6
5
3
4

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The product of two numbers is 4107. If the H.C.F. of these numbers is 37, then the greater number is:

107
111
101
185

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 Let the numbers be 37a and 37b.Then, 37a x 37b = 4107 ab = 3.Now, co-primes with product 3 are (1, 3).So, the required numbers are (37 x 1, 37 x 3) i.e., (37, 111). Greater number = 111.

Problems on H.C.F and L.C.M
The largest four – digit number which when divided by 4, 7 or 13 leaves a remainder of 3 in each case, is

9893
8739
9831
9834

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F and L.C.M of two numbers are 84 and 21 respectively. If the ratio of the two numbers is 1 : 4 , then the larger of the two numbers is

12
108
48
84

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
↑