Class 7 . Mathematics . Ganita Prakash Part II . Finding Common Ground

Chapter 3: Finding Common Ground

Ch 3

Mathematics

Class 7

Lecture 1

The Greatest of All

Reference video · Lecture 1The Greatest of All

Highest Common Factor

Definition

Highest Common Factor (HCF) — The HCF of two or more numbers is their greatest common factor; it is also called the Greatest Common Divisor (GCD).

HCF properties

A common factor divides every given number exactly. The HCF is the greatest such factor. Choosing the HCF gives the largest equal tile or bag size and therefore the fewest tiles or bags. The longest jump from zero that lands on two target numbers is their HCF.

HCF of two numbers
HCF⁡(a,b)=max⁡{d∈N:d∣a, d∣b}\operatorname{HCF}(a,b)=\max\{d\in\mathbb{N}:d\mid a,\ d\mid b\}

Use this to express the greatest common factor of two numbers.

Finding the HCF by Listing Factors

Finding the HCF by listing factors

  1. List all factors of each number.
    F(a),F(b)F(a),\quad F(b)
  2. Identify the factors that occur in every list.
    F(a)∩F(b)F(a)\cap F(b)
  3. Choose the greatest common factor.
    HCF⁡(a,b)=max⁡(F(a)∩F(b))\operatorname{HCF}(a,b)=\max\bigl(F(a)\cap F(b)\bigr)
Worked example

What is the largest square tile with whole-number side length that exactly covers a room measuring 1212 ft by 1616 ft, and how many tiles are needed?

  1. The tile side must be a common factor of the room's breadth and length.
    F(12)∩F(16)={1,2,4}F(12)\cap F(16)=\{1,2,4\}
  2. Choose the greatest common factor for the largest square tile.
    HCF⁡(12,16)=4 ft\operatorname{HCF}(12,16)=4\text{ ft}
  3. Find how many tiles fit across each dimension.
    12÷4=3,16÷4=412\div4=3,\quad 16\div4=4
  4. Multiply the number of rows by the number in each row.
    3×4=123\times4=12
Answer: Use square tiles with side length 44 ft. She needs 1212 tiles.
A rectangular room measuring 16 ft by 12 ft.
A rectangular room measuring 1616 ft by 1212 ft.

Using the HCF in Equal-Size Groups

Practice

Rice from two farms weighs 8484 kg and 108108 kg. What is the greatest whole-number bag weight that works for both, and how many bags are needed?

Hint: Choose the greatest common factor of the two amounts, then divide each amount by it.
Key step: The common factors are 1,2,3,4,6,121,2,3,4,6,12, so the HCF is 1212.
Solution: Use 1212 kg bags. The farms require 84÷12=784\div12=7 and 108÷12=9108\div12=9 bags, for 1616 bags in total.

HCF and the Longest Jump

Practice

Find the longest jump size for each pair: (a) 1414 and 3030, (b) 77 and 1111, (c) 3030 and 5050, (d) 2828 and 4242. Is each longest jump the pair's HCF?

Hint: The jump size must divide both target numbers.
Key step: Find the greatest common factor for each pair.
Solution: (a) HCF⁡(14,30)=2\operatorname{HCF}(14,30)=2; (b) HCF⁡(7,11)=1\operatorname{HCF}(7,11)=1; (c) HCF⁡(30,50)=10\operatorname{HCF}(30,50)=10; (d) HCF⁡(28,42)=14\operatorname{HCF}(28,42)=14. Each longest jump is the HCF.
Practice

Would allowing a fractional tile side change the largest square tile that exactly covers a 1212 ft by 1616 ft room?

Hint: The number of tiles along each room dimension must be a whole number.
Key step: The smallest whole-number counts of tiles matching the room's 3:43:4 dimension ratio are 33 and 44.
Solution: No. The largest side is still 44 ft: 12÷4=312\div4=3 tiles across and 16÷4=416\div4=4 tiles along. A fractional side that fits exactly can only be smaller.

Why Prime Factorisation Is Useful

A more reliable way to find the HCF

  • Listing factors can become cumbersome for numbers with many factors and it is easy to miss one.
  • Prime factorisation provides a more systematic way to find the HCF.

Quick recap

  • The HCF is the greatest factor common to all the given numbers; it is also called the GCD.
  • A square tile side must be a common factor of both room dimensions.
  • The greatest common factor gives the largest equal tile or bag size and therefore the fewest are needed.
  • The longest jump from zero that lands on both target numbers equals their HCF.
  • Listing factors can be cumbersome; prime factorisation is a systematic method to study next.
Lecture 2

Primes

Reference video · Lecture 2Primes

Prime Numbers and Prime Factorisation

Definition

Prime number — A whole number greater than 11 whose only factors are 11 and itself.

Key ideas

  • Composite number: A whole number greater than 11 with more than two factors; 11 is neither prime nor composite.
  • Prime factorisation: Writing a number as a product of prime numbers. A prime number’s prime factorisation is itself.
  • Sieve of Eratosthenes: A method for listing primes by eliminating composite numbers.
Unique prime factorisation

Every whole number greater than 11 has a prime factorisation that is unique apart from the order of the factors.

Prime factorisation
n=p1×p2×⋯×pkn=p_1\times p_2\times\cdots\times p_k

Write the number as a product of primes.

Worked example

Show that factoring 9090 in this way gives its prime factorisation.

  1. Factor the composite parts of one possible factorisation.
    90=3×30=3×2×15=3×2×3×590=3\times30=3\times2\times15=3\times2\times3\times5
  2. Rearranging the factors gives the same prime product.
    90=2×3×3×5=2×32×590=2\times3\times3\times5=2\times3^2\times5
Answer: 90=2×32×590=2\times3^2\times5

Prime Factorisation by the Division Method

Definition

Division method — A method that repeatedly divides a number by prime factors until the quotient is 11.

Using the division method

  1. Divide by a prime that divides the number exactly.
    n÷p=qn\div p=q
  2. Continue dividing each quotient by prime factors.
    q÷r=sq\div r=s
  3. Stop only when the quotient reaches 11; multiply all the prime divisors used.
    n=p1×p2×⋯×pkn=p_1\times p_2\times\cdots\times p_k

Division-method examples

  • Factor diagram: Collect the prime factors along the side and at the bottom; their product is the original number.
  • Examples: 105=3×5×7105=3\times5\times7 and 30=2×3×530=2\times3\times5.
Factor diagram: 105=3×5×7.
Factor diagram: 105=3×5×7105=3\times5\times7.
Worked example

Find the prime factorisation of 12001200 using division.

  1. Divide successively by prime factors.
    1200÷2=600,600÷2=300,300÷2=150,150÷2=751200\div2=600,\quad600\div2=300,\quad300\div2=150,\quad150\div2=75
  2. Continue until the quotient is 11, then collect all prime divisors.
    75÷3=25,25÷5=5,5÷5=175\div3=25,\quad25\div5=5,\quad5\div5=1
  3. Write repeated prime factors using powers.
    1200=2×2×2×2×3×5×5=24×3×521200=2\times2\times2\times2\times3\times5\times5=2^4\times3\times5^2
Answer: 1200=24×3×521200=2^4\times3\times5^2

Finding Factors from Prime Factorisation

Using the prime factors of 840

  • Factor test: A proposed factor can use each prime no more times than it appears in the number’s factorisation.
  • Example: 840=23×3×5×7=(22×7)(2×3×5)=28×30840=2^3\times3\times5\times7=(2^2\times7)(2\times3\times5)=28\times30, so 2828 is a factor and its partner is 3030.
  • Other checks: 1414 and 88 are factors of 840840; 27=3327=3^3 is not, because 840840 contains only one factor of 33.
  • HCF application: Prime factorisation helps simplify finding the HCF of two numbers by identifying their common prime factors.
Factor construction rule

For n=p1a1p2a2⋯pmamn=p_1^{a_1}p_2^{a_2}\cdots p_m^{a_m}, each factor is formed by choosing an exponent from 00 to aia_i for each prime.

Listing all factors

  1. Find the prime factorisation of the number.
    n=p1a1p2a2⋯pmamn=p_1^{a_1}p_2^{a_2}\cdots p_m^{a_m}
  2. Form every product using no more copies of each prime than are available.
    d=p1b1p2b2⋯pmbm,0≤bi≤aid=p_1^{b_1}p_2^{b_2}\cdots p_m^{b_m},\quad0\leq b_i\leq a_i
  3. Include 11, which uses none of the prime factors, and check that no combinations are missing.
    1=p10p20⋯pm01=p_1^0p_2^0\cdots p_m^0
Worked example

Find all factors of 225225 using its prime factorisation.

  1. Prime-factorise the number.
    225=5×5×3×3=32×52225=5\times5\times3\times3=3^2\times5^2
  2. Choose powers of 33 and 55 from exponent 00 to 22.
    3a5b,a,b∈{0,1,2}3^a5^b,\quad a,b\in\{0,1,2\}
  3. List every product, including 11.
    1,3,5,9,15,25,45,75,2251,3,5,9,15,25,45,75,225
Answer: The factors are 1,3,5,9,15,25,45,75,2251,3,5,9,15,25,45,75,225.

Prime Factorisation Length

Does a larger number have a longer prime factorisation?

  • No: The size of a number does not determine how many prime factors appear in its factorisation.
  • Counterexample: 96=2×2×2×2×2×396=2\times2\times2\times2\times2\times3 has six prime factors, while the larger number 121=11×11121=11\times11 has only two.
Practice

Find the prime factorisation of 105105.

Hint: Divide successively by prime factors.
Key step: 105=3×35105=3\times35
Solution: 105=3×5×7105=3\times5\times7.
Practice

List all factors of 9090.

Hint: Start with 90=2×32×590=2\times3^2\times5 and combine available prime powers.
Key step: 90=2×32×590=2\times3^2\times5
Solution: The factors are 1,2,3,5,6,9,10,15,18,30,45,901,2,3,5,6,9,10,15,18,30,45,90.
Practice

Is 1414 a factor of 840840? If so, what must it be multiplied by to make 840840?

Hint: Use 840=23×3×5×7840=2^3\times3\times5\times7.
Key step: 14=2×714=2\times7; the unused prime factors multiply to 6060.
Solution: Yes. 14×60=84014\times60=840.

Quick recap

  • A prime is greater than 11 and has exactly two factors: 11 and itself.
  • Every whole number greater than 11 has a unique prime factorisation, apart from order.
  • In the division method, keep dividing by primes until the quotient is 11.
  • A factor uses no more copies of each prime than the number’s prime factorisation contains.
  • List factors by forming all valid prime-power combinations, including 11.
  • Prime factorisation can help find the HCF of two numbers.
  • A larger number does not necessarily have a longer prime factorisation.
Lecture 3

Finding the HCF of Number Using Prime Factorisation

Reference video · Lecture 3Finding the HCF of Number Using Prime Factorisation

HCF by Prime Factorisation

HCF from Prime Factorisations
HCF⁡(N1,…,Nk)=∏ppmin⁡(e1p,…,ekp)\operatorname{HCF}(N_1,\ldots,N_k)=\prod_p p^{\min(e_{1p},\ldots,e_{kp})}

Use the minimum exponent of each prime shared by all the numbers.

Finding the HCF

  1. Write each number as a product of prime factors.
    Ni=∏ppeipN_i=\prod_p p^{e_{ip}}
  2. For each prime appearing in every factorisation, take its smallest exponent.
    ep=min⁡(e1p,…,ekp)e_p=\min(e_{1p},\ldots,e_{kp})
  3. Multiply the selected prime powers to get the HCF.
    HCF⁡=∏ppep\operatorname{HCF}=\prod_p p^{e_p}
  4. To list all common factors, list the factors of the HCF.
    d∣HCF⁡d\mid\operatorname{HCF}
Worked example

Find the common factors and HCF of 112112 and 8484.

  1. Prime-factorise both numbers.
    112=24×7,84=22×3×7112=2^4\times7,\qquad84=2^2\times3\times7
  2. Use the shared primes with their minimum exponents.
    HCF⁡(112,84)=22×7=28\operatorname{HCF}(112,84)=2^2\times7=28
  3. The common factors are all the factors of the HCF.
    1,2,4,7,14,281,2,4,7,14,28
Answer: The common factors are 1,2,4,7,14,281, 2, 4, 7, 14, 28; the HCF is 2828.
⚠ Common mistake

Do not compare arbitrary composite factors as though they were primes. Prime-factorise first; for example, 72=6×1272=6\times12 and 144=8×18144=8\times18 do not show that the numbers have no common factor.

Practice

Find the common factors and HCF of 5050 and 6060.

Hint: Prime-factorise each number, then take the minimum exponents.
Key step: 50=2×5250=2\times5^2 and 60=22×3×560=2^2\times3\times5.
Solution: The HCF is 2×5=102\times5=10. Its factors give the common factors: 1,2,5,101,2,5,10.
Practice

Find the HCF of 4242, 7575 and 2424.

Hint: Find the prime that appears in all three factorisations.
Key step: 42=2×3×742=2\times3\times7, 75=3×5275=3\times5^2, and 24=23×324=2^3\times3.
Solution: The only shared prime is 33, appearing once in each factorisation. Therefore, the HCF is 33.
Practice

If 72=6×1272=6\times12 and 144=8×18144=8\times18, can we conclude that 7272 and 144144 have no common factor other than 11?

Hint: The displayed factors are composite; check the numbers themselves.
Key step: 144=2×72144=2\times72.
Solution: No. Since 7272 divides 144144, they have common factors greater than 11; in fact, their HCF is 7272.

Quick recap

  • Prime-factorise every number before comparing its factors.
  • Minimum exponents of shared primes give the HCF.
  • Common factors of the numbers are exactly the factors of their HCF.
  • No shared prime factors means the HCF is 11.
  • Several numbers: use the minimum exponent shared across all their prime factorisations.
Lecture 4

Least But Not Last

Reference video · Lecture 4Least But Not Last

Meaning of the LCM

Patterned cloth strips are compared to find the shortest shared toran length.
Patterned cloth strips are compared to find the shortest shared toran length.
LCM from multiples
LCM⁡(a,b)=min⁡{n∈N:a∣n, b∣n}\operatorname{LCM}(a,b)=\min\{n\in\mathbb{N}:a\mid n,\ b\mid n\}

The LCM is the smallest positive common multiple of the numbers.

Find an LCM by listing multiples

  1. Write the multiples of each number in order.
  2. Find the first multiple that appears in every list.
  3. That first shared value is the LCM.
Worked example

Anshu uses strips of length 66 cm and Guna uses strips of length 88 cm. What is the shortest toran length they can both make?

  1. The toran lengths must be multiples of both strip lengths.
    6:6,12,18,24,30,…8:8,16,24,32,40,…6: 6,12,18,24,30,\ldots\qquad 8: 8,16,24,32,40,\ldots
  2. The first shared length is the shortest possible toran.
    LCM⁡(6,8)=24\operatorname{LCM}(6,8)=24
Answer: They can both make a toran of length 2424 cm.

LCM in repeating schedules and the Idli-Vada game

  • Repeating events: The first time two repeating schedules coincide is after a number of days equal to the LCM of their intervals.
  • Sweet-shop example: Kabamai visits every 1010 days; free gajak is given every 77 days. Their next shared day is after LCM⁡(7,10)=70\operatorname{LCM}(7,10)=70 days.
  • Idli-Vada rule: The first number that is a multiple of both chosen numbers is their LCM.
First Idli-Vada number
NumbersFirst common multiple (LCM)
4 and 612
7 and 1177
14 and 30210
15 and 55165

Finding LCM through Prime Factorisation

Prime-factor rule for the LCM

For each prime appearing in the numbers, use the greatest number of times it occurs in any one prime factorisation. Multiply these selected prime factors to get the LCM.

LCM⁡(n1,…,nk)=∏ppmax⁡(vp(n1),…,vp(nk))\operatorname{LCM}(n_1,\ldots,n_k)=\prod_p p^{\max(v_p(n_1),\ldots,v_p(n_k))}

Why the greatest occurrence count is used

  • Every common multiple must contain each prime factorisation as a part.
  • Fewest required factors: Taking the greatest occurrence count for each prime contains all the original numbers as factors.
  • Least result: Using more occurrences still gives a common multiple, but makes it larger than necessary.
LCM using prime factors
LCM⁡=∏ppep\operatorname{LCM}=\prod_p p^{e_p}

For each prime pp, epe_p is its greatest exponent among the factorizations.

Find an LCM by prime factorisation

  1. Write each number as a product of primes.
  2. For every prime present, select its greatest exponent among the factorizations.
  3. Multiply the selected prime powers.
Worked example

Find the LCM of 9696 and 360360 using prime factorisation.

  1. Prime-factorise both numbers.
    96=25×3360=23×32×596=2^5\times3\qquad 360=2^3\times3^2\times5
  2. Choose the greatest exponent for each prime: five 22s, two 33s, and one 55.
    25×32×52^5\times3^2\times5
  3. Multiply the selected prime powers.
    LCM⁡(96,360)=25×32×5=1440\operatorname{LCM}(96,360)=2^5\times3^2\times5=1440
Answer: The LCM is 14401440.
⚠ Common mistake

Do not use each prime just once or add its exponents. Use the greatest exponent in either factorisation; for example, 14=2×714=2\times7 and 35=5×735=5\times7, so their LCM is 2×5×7=702\times5\times7=70.

Practice

Find the LCM of 3030 and 7272.

Hint: Compare the exponents of 22, 33, and 55.
Key step: 30=2×3×530=2\times3\times5 and 72=23×3272=2^3\times3^2.
Solution: Take the highest exponents: 23×32×5=3602^3\times3^2\times5=360. Thus, LCM⁡(30,72)=360\operatorname{LCM}(30,72)=360.
Practice

Find the LCM of 105105, 195195, and 6565.

Hint: Factorise all three numbers and select the greatest exponent of each prime.
Key step: 105=3×5×7105=3\times5\times7, 195=3×5×13195=3\times5\times13, and 65=5×1365=5\times13.
Solution: Use 33, 55, 77, and 1313: 3×5×7×13=13653\times5\times7\times13=1365. The LCM is 13651365.
Practice

Find the LCM of 222222 and 3737.

Hint: Check whether one number is already a multiple of the other.
Key step: 222=2×3×37222=2\times3\times37.
Solution: Since 222222 is already a multiple of 3737, LCM⁡(222,37)=222\operatorname{LCM}(222,37)=222.

Quick recap

  • The LCM is the smallest positive common multiple; there is no largest common multiple.
  • The first time repeating intervals coincide is their LCM.
  • For the listing method, the first shared multiple is the answer.
  • For prime factorisation, take the greatest exponent of every prime appearing.
  • The LCM of 66 and 88 is 2424; Kabamai’s next shared free-gajak day is after 7070 days.
Lecture 5

Patterns, Properties and a Pretty Procedure?

Reference video · Lecture 5Patterns, Properties and a Pretty Procedure?

HCF patterns and general statements

Definition

Generalisation — A generalisation describes a pattern or property that holds in all cases, not just one example.

  • Factor and multiple: If one number is a factor of the other, the smaller number is the HCF. For example, 66 divides 1818, so their HCF is 66.
  • Algebraic form: If the numbers are nn and knkn, where kk is a positive integer, then their HCF is nn and their LCM is knkn.
  • Other number pairs: If one number is mm, the other can be kmkm; if one number is 7k7k, the other can be any positive-integer multiple of 7k7k.
HCF patterns
Pair of numbersHCF
Two consecutive even numbers22
Two consecutive odd numbers11
Two even numbersAn even number; the exact HCF depends on the pair
Two consecutive numbers11
Two co-prime numbers11
Common factors and differences

A common factor of two numbers must divide their difference. Consecutive numbers differ by 11, while consecutive even or consecutive odd numbers differ by 22.

LCM patterns

When the LCM is one of the numbers

  • Condition: The LCM of two numbers is one of them exactly when the smaller number divides the larger.
  • Algebraic form: For nn and knkn, the LCM is knkn.
  • Co-prime numbers: Their LCM is their product.
  • Consecutive numbers: Their LCM is their product because their HCF is 11.
LCM patterns
Pair of numbersLCM
Co-prime numbers a,ba,babab
Consecutive numbers a,a+1a,a+1a(a+1)a(a+1)
Consecutive even numbers 2a,2(a+1)2a,2(a+1)2a(a+1)2a(a+1)
Multiples of 33: 3a,3b3a,3b3LCM⁡(a,b)3\operatorname{LCM}(a,b)

Changing numbers and common factors

Doubling both numbers

If both numbers are doubled, their HCF doubles: HCF⁡(2a,2b)=2HCF⁡(a,b)\operatorname{HCF}(2a,2b)=2\operatorname{HCF}(a,b). Each number gains a factor of 22, which also becomes part of their common factors.

Example: doubling
NumbersPrime factorsHCF
270,50270,50270=2×33×5270=2\times3^3\times5; 50=2×5250=2\times5^22×5=102\times5=10
540,100540,100540=22×33×5540=2^2\times3^3\times5; 100=22×52100=2^2\times5^222×5=202^2\times5=20
HCF of two multiples of the same number

For a common multiplier cc, HCF⁡(ca,cb)=cHCF⁡(a,b)\operatorname{HCF}(ca,cb)=c\operatorname{HCF}(a,b). This HCF equals cc exactly when aa and bb are co-prime.

Examples with a common multiplier

  • Example: 14×614\times6 and 14×914\times9 have HCF 14×HCF⁡(6,9)=4214\times\operatorname{HCF}(6,9)=42.
  • HCFs: The pairs (18×10,18×15)(18\times10,18\times15), (10×38,10×21)(10\times38,10\times21), (5×13,5×20)(5\times13,5\times20) and (12×16,12×20)(12\times16,12\times20) have HCFs 9090, 1010, 55 and 4848, respectively.
  • When HCF equals the multiplier: This holds for the second and third listed pairs, since HCF⁡(38,21)=1\operatorname{HCF}(38,21)=1 and HCF⁡(13,20)=1\operatorname{HCF}(13,20)=1. It does not hold for the first or fourth pair.

Efficient procedures for HCF and LCM

Definition

Common-factor ladder method — Repeatedly divide both numbers by a common factor until the remaining quotients are co-prime.

Reading the ladder
QuantityCalculation
HCFProduct of all common divisors used
LCMProduct of the common divisors and both final quotients

Why the ladder works

  • Shared factors: The recorded common divisors contribute to the HCF.
  • Remaining factors: The final quotients supply the additional factors needed to form the LCM.
  • Flexible divisors: You may divide by any common factor, not only a prime factor; for example, divide 300300 and 150150 by 5050, then divide 66 and 33 by 33.

Additional ladder result

  • For 8484 and 180180: Divide by common factors 22, 22 and 33 to leave 77 and 1515. Thus, the HCF is 2×2×3=122\times2\times3=12, and the LCM is 2×2×3×7×15=12602\times2\times3\times7\times15=1260.

Using the ladder

  1. Write the two numbers side by side.
  2. Divide both by a common factor and record the factor.
  3. Repeat until the resulting numbers are co-prime.
  4. Multiply the recorded common factors for the HCF; include both final quotients as well to get the LCM.
Worked example

Use the common-factor ladder to find the HCF and LCM of 300,150300,150 and of 630,770630,770.

  1. For 300300 and 150150, divide successively by the common factors 22, 55, 55 and 33; the final quotients are 22 and 11.
    23001505150755301536321\begin{array}{r|rr}2&300&150\\5&150&75\\5&30&15\\3&6&3\\&2&1\end{array}
  2. Multiply the common factors for the HCF, and include the final quotients for the LCM.
    HCF⁡(300,150)=2×5×5×3=150,LCM⁡(300,150)=2×5×5×3×2×1=300\operatorname{HCF}(300,150)=2\times5\times5\times3=150,\qquad \operatorname{LCM}(300,150)=2\times5\times5\times3\times2\times1=300
  3. For 630630 and 770770, divide by 22, then 55, then 77; the final quotients are 99 and 1111.
    2630770531538576377911\begin{array}{r|rr}2&630&770\\5&315&385\\7&63&77\\&9&11\end{array}
  4. Multiply the common factors for the HCF, and include both final quotients for the LCM.
    HCF⁡(630,770)=2×5×7=70,LCM⁡(630,770)=2×5×7×9×11=6930\operatorname{HCF}(630,770)=2\times5\times7=70,\qquad \operatorname{LCM}(630,770)=2\times5\times7\times9\times11=6930
Answer: For 300300 and 150150, the HCF is 150150 and the LCM is 300300. For 630630 and 770770, the HCF is 7070 and the LCM is 69306930.
⚠ Common mistake

Do not stop dividing after removing just one common factor. Continue until the final quotients are co-prime; otherwise, the HCF or LCM may be incomplete.

Practice

Use common factors to find the HCF and LCM of 9090 and 150150.

Hint: Divide both numbers by 1010, then continue with a common factor.
Key step: After dividing by 1010, the quotients are 99 and 1515; divide both by 33.
Solution: The final quotients are 33 and 55. Thus, HCF⁡=10×3=30\operatorname{HCF}=10\times3=30 and LCM⁡=10×3×3×5=450\operatorname{LCM}=10\times3\times3\times5=450.
Practice

Use common factors to find the HCF and LCM of 8484 and 132132.

Hint: Divide both numbers by 22, then by 22 again, and then by 33.
Key step: The common divisors multiply to 1212, leaving the co-prime quotients 77 and 1111.
Solution: The HCF is 2×2×3=122\times2\times3=12. The LCM is 2×2×3×7×11=9242\times2\times3\times7\times11=924.

Quick recap

  • If one number divides the other, the smaller is the HCF and the larger is the LCM.
  • Consecutive numbers are co-prime; consecutive even numbers have HCF 22, and consecutive odd numbers have HCF 11.
  • Co-prime numbers have LCM equal to their product; multiples of 33 do not have one fixed LCM rule beyond LCM⁡(3a,3b)=3LCM⁡(a,b)\operatorname{LCM}(3a,3b)=3\operatorname{LCM}(a,b).
  • Doubling both numbers doubles their HCF.
  • For caca and cbcb, the HCF is cHCF⁡(a,b)c\operatorname{HCF}(a,b).
  • In the common-factor ladder, multiply shared divisors for the HCF; include both final quotients as well for the LCM.
Lecture 6

Property Involving Both the HCF and the LCM

Reference video · Lecture 6Property Involving Both the HCF and the LCM

Comparing the LCM with the Product

  • Common multiples: A common multiple is divisible by both numbers; their product is one such multiple.
  • Comparison: The section explores how the LCM relates to the product of two numbers.

The HCF–LCM Relationship

HCF–LCM property for two numbers

For any two positive integers, their HCF multiplied by their LCM equals their product.

HCF⁡(a,b)×LCM⁡(a,b)=ab\operatorname{HCF}(a,b)\times\operatorname{LCM}(a,b)=ab

Why the property works

  • Prime factors: For each prime, let its powers in the two numbers be prp^r and psp^s.
  • HCF and LCM: The HCF uses the smaller exponent, min⁡(r,s)\min(r,s); the LCM uses the larger, max⁡(r,s)\max(r,s).
  • Product comparison: Since min⁡(r,s)+max⁡(r,s)=r+s\min(r,s)+\max(r,s)=r+s, the prime factors in HCF × LCM match those in the product.
Prime-factorisation rules
HCF⁡:pmin⁡(r,s),LCM⁡:pmax⁡(r,s)\operatorname{HCF}: p^{\min(r,s)},\qquad \operatorname{LCM}: p^{\max(r,s)}

Use the lower prime powers for the HCF and the higher prime powers for the LCM.

Finding the HCF and LCM by prime factorisation

  1. Write each number as a product of prime powers.
  2. For the HCF, multiply the common primes using their smaller exponents.
    HCF⁡=∏pmin⁡(r,s)\operatorname{HCF}=\prod p^{\min(r,s)}
  3. For the LCM, multiply all primes using their larger exponents.
    LCM⁡=∏pmax⁡(r,s)\operatorname{LCM}=\prod p^{\max(r,s)}
  4. Check the result using the product relationship.
    HCF⁡×LCM⁡=ab\operatorname{HCF}\times\operatorname{LCM}=ab
Worked example

Find the HCF and LCM of 105105 and 9595, and verify their relationship.

  1. Prime-factorise the two numbers.
    105=3×5×7,95=5×19105=3\times5\times7,\qquad 95=5\times19
  2. Take common prime factors with the lower powers for the HCF.
    HCF⁡(105,95)=5\operatorname{HCF}(105,95)=5
  3. Take each prime factor with the higher power for the LCM.
    LCM⁡(105,95)=3×5×7×19=1995\operatorname{LCM}(105,95)=3\times5\times7\times19=1995
  4. Verify that the product equals HCF times LCM.
    105×95=9975=5×1995105\times95=9975=5\times1995
Answer: HCF⁡=5\operatorname{HCF}=5, LCM⁡=1995\operatorname{LCM}=1995, and 105×95=5×1995105\times95=5\times1995.
⚠ Common mistake

Do not apply HCF⁡×LCM⁡=product\operatorname{HCF}\times\operatorname{LCM}=\text{product} to three numbers in general. For example, for 2,4,82,4,8, the HCF is 22, the LCM is 88, but their product is 6464.

Useful consequences

  • Coprime numbers: If the HCF is 11, then the LCM equals the product.
  • Different primes: For distinct primes mm and nn, the LCM is mnmn: it is greater than both primes and equal to their product.
  • Common cube size: A cube fits a rectangular box exactly when its side length divides all three dimensions.
Practice

For 4545 and 105105, find the HCF and LCM. What must the LCM be multiplied by to obtain the product?

Hint: Prime-factorise both numbers and use the HCF–LCM relationship.
Key step: 45=32×545=3^2\times5 and 105=3×5×7105=3\times5\times7.
Solution: HCF⁡=15\operatorname{HCF}=15, LCM⁡=315\operatorname{LCM}=315; multiply the LCM by 1515. Indeed, 45×105=15×315=472545\times105=15\times315=4725.
Practice

A herd has fewer than 200200 cows. The cows divide equally through groups of 33, 55, and 77. How many cows could there be?

Hint: The total must be a common multiple of all three group sizes.
Key step: Find the least common multiple of 33, 55, and 77.
Solution: LCM⁡(3,5,7)=105\operatorname{LCM}(3,5,7)=105. The only positive common multiple below 200200 is 105105, so the herd has 105105 cows.
Practice

A box measures 1212 cm by 1818 cm by 3636 cm. Which cube side lengths from 9,6,4,3,29,6,4,3,2 cm fit exactly without gaps?

Hint: A valid side length must divide each dimension.
Key step: Find HCF⁡(12,18,36)\operatorname{HCF}(12,18,36) and select its divisors from the list.
Solution: HCF⁡(12,18,36)=6\operatorname{HCF}(12,18,36)=6. The listed divisors of 66 are 66 cm, 33 cm, and 22 cm.

Quick recap

  • The product of two numbers is a common multiple, so their LCM is no greater than their product.
  • For two positive integers, HCF⁡×LCM⁡=product of the numbers\operatorname{HCF}\times\operatorname{LCM}=\text{product of the numbers}.
  • In prime factorisation, the HCF uses the lower exponents and the LCM the higher exponents.
  • If two numbers are coprime, their LCM equals their product.
  • The HCF–LCM product rule does not generally extend to three numbers.
Lecture 7

Summary

Reference video · Lecture 7Summary

Prime Factorisation and Factors

  • Prime factorisation: Write a number as a product of primes; this factorisation is unique apart from the order of the factors.
  • Factors: Factors can be formed from subparts of the prime factorisation, including 1 and the number itself.

Highest Common Factor (HCF)

Prime-factor rule for HCF

A common factor can use only primes that occur in each number’s prime factorisation. For the HCF, use the minimum number of occurrences of each shared prime.

HCF=∏ppmin⁡(e1,p,e2,p,…)\mathrm{HCF}=\prod_p p^{\min(e_{1,p},e_{2,p},\ldots)}

Lowest Common Multiple (LCM)

Prime-factor rule for LCM

A common multiple must contain the prime factors of each number. For the LCM, use the greatest number of occurrences of each prime across the factorisations.

LCM=∏ppmax⁡(e1,p,e2,p,…)\mathrm{LCM}=\prod_p p^{\max(e_{1,p},e_{2,p},\ldots)}

Find HCF and LCM from prime factorisations

  1. Write each number as a product of primes.
  2. For the HCF, multiply the shared primes using their minimum occurrence counts.
  3. For the LCM, multiply all primes present using their maximum occurrence counts.
Worked example

Find the HCF and LCM of 12 and 18.

  1. Write the numbers as products of primes.
    12=22×3,18=2×3212=2^2\times3,\quad 18=2\times3^2
  2. Use the minimum occurrence count for each prime shared by both numbers.
    HCF=2×3=6\mathrm{HCF}=2\times3=6
  3. Use the maximum occurrence count for each prime present.
    LCM=22×32=36\mathrm{LCM}=2^2\times3^2=36
Answer: HCF = 6; LCM = 36.

Patterns and Related Procedures

  • Patterns: HCF and LCM follow useful patterns for multiples, consecutive numbers, even numbers, and co-prime pairs.
  • Efficient procedure: Repeatedly divide both numbers by common factors; the common factors give the HCF, and the process can also help find the LCM.

Mathematical Terms

Practice

Find the HCF of 24 and 36 using prime factorisation.

Hint: Use the minimum occurrence count of each shared prime.
Key step: 24=23×324=2^3\times3 and 36=22×3236=2^2\times3^2.
Solution: The shared primes use minimum powers 222^2 and 33, so HCF=22×3=12\mathrm{HCF}=2^2\times3=12.
Practice

Find the LCM of 8, 12 and 20 using prime factorisation.

Hint: Use the maximum occurrence count of each prime present.
Key step: 8=238=2^3, 12=22×312=2^2\times3, and 20=22×520=2^2\times5.
Solution: The maximum powers are 232^3, 33 and 55, so LCM=23×3×5=120\mathrm{LCM}=2^3\times3\times5=120.

Quick recap

  • Prime factorisation expresses a number as a product of primes.
  • Finding all factors from a prime factorisation can require checking many combinations.
  • The HCF uses the minimum occurrence count of each prime common to all the numbers.
  • The LCM uses the maximum occurrence count of every prime present in the numbers.
  • Patterns involving consecutive, even and co-prime numbers were explored.
  • A procedure for finding HCF and LCM together, and a quicker version, were covered.
  • Conjecture and generalisation are mathematical terms introduced in the chapter.

Formula sheet

HCF of two numbers
HCF⁡(a,b)=max⁡{d∈N:d∣a, d∣b}\operatorname{HCF}(a,b)=\max\{d\in\mathbb{N}:d\mid a,\ d\mid b\}
Prime factorisation
n=p1×p2×⋯×pkn=p_1\times p_2\times\cdots\times p_k
HCF from Prime Factorisations
HCF⁡(N1,…,Nk)=∏ppmin⁡(e1p,…,ekp)\operatorname{HCF}(N_1,\ldots,N_k)=\prod_p p^{\min(e_{1p},\ldots,e_{kp})}
LCM from multiples
LCM⁡(a,b)=min⁡{n∈N:a∣n, b∣n}\operatorname{LCM}(a,b)=\min\{n\in\mathbb{N}:a\mid n,\ b\mid n\}
LCM using prime factors
LCM⁡=∏ppep\operatorname{LCM}=\prod_p p^{e_p}
Prime-factorisation rules
HCF⁡:pmin⁡(r,s),LCM⁡:pmax⁡(r,s)\operatorname{HCF}: p^{\min(r,s)},\qquad \operatorname{LCM}: p^{\max(r,s)}

Mathematics — ALL CHAPTERS

1

Large Numbers Around Us

View

2

Arithmetic Expressions

View

3

A Peek Beyond the Point

View

4

Expressions using Letter-Numbers

View

5

Parallel and Intersecting Lines

View

6

Number Play

View

7

A Tale of Three Intersecting Lines

View

8

Working with Fractions

View

1

Geometric Twins

View

2

Operations with Integers

View

3

Finding Common Ground

View

4

Another Peek Beyond the Point

View

5

Connecting the Dots

View

6

Constructions and Tilings

View

7

Finding the Unknown

View