0% found this document useful (0 votes)
52 views

Topic 1_HCF and LCM

The document provides a comprehensive overview of Highest Common Factor (HCF) and Lowest Common Multiple (LCM), including methods for calculating them such as prime factorization and common division. It includes numerous examples and applications of HCF and LCM in problem-solving scenarios. Additionally, it discusses the relationship between HCF and LCM, emphasizing their mathematical properties.

Uploaded by

Shubham Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
52 views

Topic 1_HCF and LCM

The document provides a comprehensive overview of Highest Common Factor (HCF) and Lowest Common Multiple (LCM), including methods for calculating them such as prime factorization and common division. It includes numerous examples and applications of HCF and LCM in problem-solving scenarios. Additionally, it discusses the relationship between HCF and LCM, emphasizing their mathematical properties.

Uploaded by

Shubham Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 56

LCM and HCF

Contents

HCF

LCM

Exercise Based on HCF and


LCM
.
Example 1. Find the HCF of 84 and 96.
Example: Find the HCF of 1266, 1461 and 1863.
Example: Find the HCF of 25.5, 42.5 and 170.

Example: Find the HCF of 36.54, 48.42 and 58.41.


Ex:
Example: What is the greatest number that will divide 3600 and 2715 and leave
remainder 9 and 6, respectively.
Example: Find the greatest number which will divide 415, 748 and 1007 so as to leave a
remainder 8 in each case.

Example: The numbers 12284 and 8655 when divided by a certain number of three digits, leave the same
remainder. Find that number of three digits.
Ex. Find the LCM of 12, 16, 21, 36.

Ex. Find the LCM of 27, 36, 80, and 175.


Example. Find the LCM of 18, 32, 72 and 96.

Note: The product of any two numbers is equal to the product of their HCF and LCM.
Example: Find the LCM of 0.72, 0.64, and 0.968 .
Example: Find the LCM of
Applications of LCM & HCF
• Greatest Number that will leave no remainder when divides a, b and c

Required number = HCF of a, b and c

Example
A shopkeeper has three cakes of weight 18 kg, 45 kg and 36 kg. If he
wants to make these cakes into pieces of equal weight without
wastage, what is the maximum possible weight of each piece?

(1) 1 (2) 9 (3) 12 (4) 13


Applications of LCM & HCF
• The greatest number that will divide a, b & c leaving
remainder x, y & z respectively

Required number = HCF of {(a – x), (b – y), (c – z)}

Example
What is the greatest number that divide 20, 50, and 40
leaving 2, 5 and 4 as remainder?
Here a–x=
b–y=
c–z=
Required Number =
Applications of LCM & HCF
• To find the greatest number that will divide x, y and z leaving the
same remainder “r” in each case.

Required number = HCF of (x – r), (y – r) and (z – r)


Example
Find the greatest number which will divide 369, 449, 689,
5009 and 729 so as to leave the remainder 9 in each case
(A) 2 (B) 49 (C) 35 (D) 40

Required Number is
HCF of {(369-9), (449-9), (689-9), (5009 – 9), (729 – 9)}
= HCF of {360, 440, 680, 5000, 720}
= 40
Applications of LCM & HCF
• To find the greatest number that will divide x, y and z
leaving the same remainder in each case.
Required number = HCF of |x – y|, |y – z| and |z – x|

Example
What is the greatest number that will divide 1305, 4665 and
6905 leaving in each case the same remainder? Also
calculate the remainder.
(1) 1210, 158 (2) 1120, 158
(3) 1120, 185 (4) 1210, 185
Solution
Here we have
|4665 – 1305|, |6905 – 4665|, |6905 – 1305|
= 3360, 2240, 5600
= 1120 x 3, 1120 x 2, 1120 x 5
Required number = HCF of (3360, 2240, 5600) = 1120

To calculate Remainder
1305 = 1120 x 1 + 185
So the Remainder = 185
Applications of LCM & HCF
• Least number which is exactly divisible by a, b, c
Required number = LCM of x, y and z
Sequence = n x LCM
(Where n is a natural Number)
Example

Find the greatest number of five digits which is divisible by


32, 36, 40, 42 and 48
(a) 999720 (b) 90702 (C) 90720 (d) 90730
Solution

Step
I LCM of (32, 36, 40, 42, 48) = 10080
Step II
Find greater number of 5 digit which multiple of 10080

10080 99999 9
90720
9279
Greatest number = 90720
Applications of LCM & HCF
• To find least number which when divided by a, b, c leaves
“r” as a remainder
Required number = LCM of (a, b, c) + r

Example
What is the smallest sum which a person can have such that
when he distributed @ Rs. 2.5 or Rs 20 or Rs 12 or Rs. 7.5 per
person in a group, he is always left with Rs. 2.00?
(A) Rs. 62 (B) Rs. 80 (C) Rs. 90 (D) Rs. 100
Solution
According to the problem the person must have the money
equal to the LCM of 2.5, 20, 12 and 7.5 and the remainder
money always left.
Applications of LCM & HCF
• Least number which when divided by a, b, c leaves x, y, z
as remainder, such that a – x = b – y = c – z = k (say)
Required number = LCM of (a, b, c) – k

Example

What is the greatest number of 4 digits that when divided


by the numbers 6, 9, 12, 17 leaves 5, 8, 11, 16 as
remainders respectively?
(a) 9791 (b) 9793 (c) 9895 (d) 9497
Solution
Step 1 Here,
6 – 5 = 9 – 8 = 12 – 11= 17 – 16 = 1 = K (let)
Step 2 LCM of 6, 9, 12, 17 = 17 x 9 x 4 = 17 x 36 = 612
Step 3 Find Greatest 4 digit number which is multiple of 612

612 9999
612 16

3879
Greatest Number
3672
= 9999 – 207 = 9792
207
Step 4 Required number = (LCM) n - K
= 9792 - 1 = 9791
Prime factorization
• It is the expression of a given number as the product of prime
numbers.
• It can be done using factor tree method or division method.
• Fundamental Theorem of Arithmetic states that every
composite number has only one factorization.
Factor tree method
• Draw the factor tree and write down the prime factorisation of the following numbers

https://www.youtube.com/watch?v=tW97UU01ShY
Prime factorization through division
method
• STEPS
Divide the number with a prime number which will divide it
exactly.
Continue dividing the quotient until you get a quotient which is
a prime number.
HCF (HIGHEST
COMMON
FACTOR)
Hcf (highest common factor)
• Highest common factor (H.C.F) of two or more numbers is
the greatest number which divides each of them exactly.
There are many methods to find them.
1.listing the factors
2.HCF by Prime Factorization
3.HCF by Common division method
4. HCF by long division method.
Find the hcf of following numbers using the
method of listing factors.
• 24,30
24- 1,2,3,4,6,8,12,24
30- 1,2,3,5,6,10,15,30
COMMON FACTORS OF 24 AND 30- 1,2,3,6
HIGHEST COMMON FACTOR- 6
• 24,72
24-1,2,3,4,6,8,12,24,
72-1,2,3,4,8,9,18,24,36,72
Common factors of 24and 72 are 1,2,3,4,8,24
Highest common factor- 24
Find the HCF of following numbers using the
method of Prime factorization.
• Step 1: find the prime factors of given numbers.
• Step 2:find the common factors and circle them.
• Step 3 multiply the common factors.
30,96
• Prime factorization of 30- 2x3x5
• Prime factorization of 96- 2x2x2x2x3x2
• Hcf -2x3= 6
FINDING HCF BY COMMON DIVISION
METHOD
STEP 1 -Divide all the three numbers by any common factor.
STEP 2 - If there are still any common factors, again divide
the quotients by them.
STEP 3 - Keep dividing until there is no common factor.
STEP 4- The product of these common factors will give the
HCF.
Find the HCF of following numbers using the method of
division by common factors.

1. 12,18,24
2. 28,35,49
3. 32,64,96,128
4. 70,105,175
1.12,18,24

HCF OF 12,18 and


24 is 3x2=6
28,35,49

HCF OF 28,35 AND 49 IS 7.


32,64,96,128

HCF OF 32,64,96 AND 128 = 8X4=32


Finding hcf by long division method
Step 1.We divide the bigger number by smaller one.
Step 2. Divide smaller number in step 1 with remainder
obtained in step 1.
Step 3. Divide divisor of second step with remainder
obtained in step 2.
Step 4. We will continue this process till we get remainder
zero and divisor obtained in end is the required H.C.F.

https://www.youtube.com/watch?v=eljVa2KqOTo
Find the HCF of following numbers using the
method of long division.
1. 144,198

HCF of 144 and 198 is 18.


Lcm(lowest common multiple)
• The lowest common multiple of two or more numbers is the
lowest of their common multiples.
• It is either equal to or greater than the numbers.
• The two methods to find LCM are
1. Prime Factorization
2. Common division
Lcm through Prime factorization
• Step 1- Do the prime factorization of all the
numbers.
• Step 2- Express it in terms of powers.
• Step 3- Multiply the highest powers of each
number.
Find the Lcm using prime factorization.
• 72,90
Prime Factorization of 72-2x2x2x3x3
= 23 x 32
Prime Factorization of 90 – 2x5x3x3
= 21x 51x 32
LCM of 72 and 90 = 23 x 32 x51
=2x2x2x3x3x5=360
b)16,30,42

Prime factorization of 16= 2x2x2x2=24


Prime factorization of 30=2x3x5= 21x31x51
prime factorization of 42= 2x3x7=21x31x71
lcm of 16,30 and 42 =24 x31 x 51x71
2x2x2x2x3x5x7
=4x4x15x7=16x105=1680
LCM by
Common
Division Method
Find the lcm of following numbers by
common division method.
1. 40,80,120,160

LCM of 40,80,120 and 160 =20x2x2x3x2=40x12=480


30,48,120

LCM of 30,48,120 =2x3x2x2x2x5x2=240

3 . 72,108,144
RELATIONSHIP BETWEEN HCF AND LCM
• The product of two numbers is the product of their HCF and
LCM.
• a x b= HCF x LCM

• a = HCF x LCM
b
• b = HCF x LCM
a
• HCF= a xb
LCM
• LCM= a xb
HCF
RELATIONSHIP BETWEEN HCF AND LCM
• The product of two numbers is the product of their HCF and
LCM.
• a x b= HCF x LCM

• a = HCF x LCM
b
• b = HCF x LCM
a
• HCF= a xb
LCM
• LCM= a xb
HCF
• The HCF of two numbers is 12 and their product is
4320. What is their LCM? If one of the numbers is 60,
what is the other number?
HCF =12
Ax B=4320
LCM= AXB = 4320 =360
HCF 12
ONE NUMBER=60
THE OTHER NUMBER= 4320 =72
60
OR
B= HCF X LCM= 12X 360 = 4320 =72
A 60 60
• The HCF and LCM of two numbers is 15 and 450
respectively. If one number is 75, what is the other
number?
HCF= 15
LCM= 450
A= 75

• B= HCFX LCM =15X450 = 90


A 75
Thank You

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy