Thursday , June 20 2019
Home / APTITUDE / Aptitude: Problems on H.C.F and L.C.M

Aptitude: Problems on H.C.F and L.C.M

problem on H.C.F and L.C.M

   1. Factors and Multiples: –If number a divided another number b exactly, we say that a is a factor of b. In this case, b is called a multiple of a.

2. Highest Common Factor (H.C.F.) or Greatest Common Measure (G.C.M.) or Greatest Common Divisor (G.C.D.): The H.C.F. of two or more than two numbers is the greatest number that divides each of them exactly. There are two methods of finding the H.C.F. of a given set of numbers:

I. Factorization Method: Express the each one of the given numbers as the product of prime factors. The product of least powers of common prime factors gives H.C.F.

II. Division Method: Suppose we have to find the H.C.F. of two given numbers, divide the larger by the smaller one. Now, divide the divisor by the remainder. Repeat the process of dividing the preceding number by the remainder last obtained till zero is obtained as remainder. The last divisor is required H.C.F.

Finding the H.C.F. of more than two numbers: Suppose we have to find the H.C.F. of three numbers, then, H.C.F. of [(H.C.F. of any two) and (the third number)] gives the H.C.F. of three given number. Similarly, the H.C.F. of more than three numbers may be obtained.

3. Least Common Multiple (L.C.M.): The least number which is exactly divisible by each one of the given numbers is called their L.C.M. There are two methods of finding the L.C.M. of a given set of numbers:

I. Factorization Method: Resolve each one of the given numbers into a product of prime factors. Then, L.C.M. is the product of highest powers of all the factors.

II. Division Method (short-cut): Arrange the given numbers in a rwo in any order. Divide by a number which divided exactly at least two of the given numbers and carry forward the numbers which are not divisible. Repeat the above process till no two of the numbers are divisible by the same number except 1. The product of the divisors and the undivided numbers is the required L.C.M. of the given numbers.

4. Product of two numbers = Product of their H.C.F. and L.C.M.

5. Co-primes: Two numbers are said to be co-primes if their H.C.F. is 1.

6. H.C.F. and L.C.M. of Fractions:
1. H.C.F. =H.C.F. of Numerators/L.C.M. of Denominators
2. L.C.M. =L.C.M. of Numerators/H.C.F. of Denominators

8. H.C.F. and L.C.M. of Decimal Fractions: In a given numbers, make the same number of decimal places by annexing zeros in some numbers, if necessary. Considering these numbers without decimal point, find H.C.F. or L.C.M. as the case may be. Now, in the result, mark off as many decimal places as are there in each of the given numbers.

9. Comparison of Fractions: Find the L.C.M. of the denominators of the given fractions. Convert each of the fractions into an equivalent fraction with L.C.M as the denominator, by multiplying both the numerator and denominator by the same number. The resultant fraction with the greatest numerator is the greatest.

QUESTIONS

1.Find the greatest number that will divide 43, 91 and 183 so as to leave the same remainder in each case.
A.4
B.7
C.9
D.13
2.The H.C.F. of two numbers is 23 and the other two factors of their L.C.M. are 13 and 14. The larger of the two numbers is:
A.276
B.299
C.322
D.345
3.Six bells commence tolling together and toll at intervals of 2, 4, 6, 8 10 and 12 seconds respectively. In 30 minutes, how many times do they toll together ?
A.4
B.10
C.15
D.16
4.Let N be the greatest number that will divide 1305, 4665 and 6905, leaving the same remainder in each case. Then sum of the digits in N is:
A.4
B.5
C.6
D.8
5.The greatest number of four digits which is divisible by 15, 25, 40 and 75 is:
A.9000
B.9400
C.9600
D.9800
6.The product of two numbers is 4107. If the H.C.F. of these numbers is 37, then the greater number is:
A.101
B.107
C.111
D.185
7.Three number are in the ratio of 3 : 4 : 5 and their L.C.M. is 2400. Their H.C.F. is:
A.40
B.80
C.120
D.200
8.The G.C.D. of 1.08, 0.36 and 0.9 is:
A.0.03
B.0.9
C.0.18
D.0.108
9.The product of two numbers is 2028 and their H.C.F. is 13. The number of such pairs is:
A.1
B.2
C.3
D.4
10.The least multiple of 7, which leaves a remainder of 4, when divided by 6, 9, 15 and 18 is:
A.74
B.94
C.184
D.364

About rahul kumar

Check Also

aptitude :: height and distance

Trigonometry: In a right angled OAB, where BOA = , i. sin = Perpendicular = …

TIME AND DISTENCE

TIME AND DISTENCE FORMULA 1. Speed, Time and Distance: Speed = Distance , Time = …

18 comments

  1. Buy Liquid Doxycycline Provera Medicine In Us Cash Delivery viagra Levitra Nuova Formulazione

  2. Kamagra Australia Shop Dove Acquistare Cialis Online Priligy Viagra Together buy viagra online Cialis Funziona Costo Amoxicillin Without A Prescription

  3. Very nice post. I just stumbled upon your weblog
    and wished to mention that I’ve really enjoyed browsing your weblog posts.
    After all I’ll be subscribing on your feed and I
    am hoping you write once more soon!

  4. Mail Order Celebrex Worldwide Provera Online Propecia Epilobio generic 5mg cialis best price Comprar Cialis En Espana Sin Receta 2 Clomid Par Jour Definir Priligy

  5. Cephalexin Dog Urinary Infection Azithromycin Part Of Keflex Family Viagra Super Active Generi viagra Valtrex X Zovirax

  6. Simply want to say your article is as surprising.
    The clearness in your post is just excellent and i could
    assume you are an expert on this subject. Fine with your permission let me to
    grab your feed to keep updated with forthcoming post.
    Thanks a million and please keep up the rewarding work.

  7. Amoxicillin Dosage Chicken Viagra 100mg Effets Secondaires cialis canada Order Synthroid Online No Prescription Buy Clomiphene And Gonadotropins

  8. Hi there, I think your site could possibly be having internet browser compatibility issues.

    When I look at your blog in Safari, it looks fine however,
    if opening in IE, it has some overlapping issues.
    I just wanted to give you a quick heads up! Apart from that,
    fantastic website!

  9. Hi to every body, it’s my first pay a quick visit of this website; this
    web site includes remarkable and really excellent material in favor of readers.

  10. Hello! Do you know if they make any plugins to protect against hackers?
    I’m kinda paranoid about losing everything I’ve worked
    hard on. Any suggestions?

  11. You actually make it seem so easy with your presentation but I find this matter to be actually something that I
    think I would never understand. It seems too complex and extremely broad for me.
    I’m looking forward for your next post, I will try to get the hang of it!

  12. Howdy would you mind letting me know which hosting company you’re using?
    I’ve loaded your blog in 3 completely different web browsers
    and I must say this blog loads a lot faster then most. Can you suggest a good internet hosting provider at a fair price?
    Thank you, I appreciate it!

  13. Have you ever thought about creating an e-book or guest authoring on other blogs?
    I have a blog based upon on the same subjects you discuss and would
    love to have you share some stories/information. I know my readers would enjoy your work.
    If you’re even remotely interested, feel free to shoot me an email.

  14. I am extremely impressed with your writing skills and also with the layout on your blog.
    Is this a paid theme or did you customize it yourself?
    Either way keep up the nice quality writing, it is rare to
    see a nice blog like this one today.

  15. Hi, I do believe this is a great website. I stumbledupon it 😉 I’m going to return once again since i
    have book marked it. Money and freedom is the best way
    to change, may you be rich and continue to guide other people.

  16. This article will help the internet viewers for setting up new website or even a weblog from start to end.

  17. Does your website have a contact page? I’m having problems locating it but,
    I’d like to shoot you an e-mail. I’ve got some suggestions for your blog you might be interested in hearing.
    Either way, great site and I look forward to seeing
    it improve over time.

Leave a Reply

Your email address will not be published. Required fields are marked *