Class 10 . Mathematics . Mathematics . Real Numbers

Chapter 1: Real Numbers

Ch 1

Mathematics

Class 10

Lecture 1

Introduction

Reference video · Lecture 1Introduction

What this chapter studies

Main ideas

  • Euclid’s division algorithm writes a positive integer as divisor × quotient + remainder, with the remainder smaller than the divisor; it is used to find HCF.
  • Fundamental Theorem of Arithmetic states that each composite number has a unique prime factorization, apart from the order of factors.
  • Applications of prime factorization include finding HCF and LCM, proving the irrationality of numbers such as 2\sqrt{2}, 3\sqrt{3} and 5\sqrt{5}, and determining the decimal nature of rational numbers.
Euclid’s division algorithm
a=bq+r,0≤r<ba=bq+r,\qquad 0\le r<b

For positive integers, the remainder is non-negative and smaller than the divisor.

Fundamental Theorem of Arithmetic

Definition

Prime factorization — Writing a composite number as a product of prime numbers.

Fundamental Theorem of Arithmetic

Every composite number can be expressed as a product of primes, and this factorization is unique except for the order of the prime factors.

n=p1e1p2e2⋯pkekn=p_1^{e_1}p_2^{e_2}\cdots p_k^{e_k}

Key points

  • Repeated factors are written as powers; for example, 2×2×2=232\times2\times2=2^3.
  • Uniqueness means the primes and their exponents are fixed, regardless of the order in which the factors are written.
  • Example: 253=11×23253=11\times23.
  • Further application: the prime factorization of the denominator of a rational number reveals whether its decimal expansion terminates or repeats.
Factor tree showing the prime factorization of 32760.
Factor tree showing the prime factorization of 32760.
Worked example

Find the prime factorization of 3276032760.

  1. Write 32760 as a product of prime factors, then collect repeated factors as powers.
    32760=2×2×2×3×3×5×7×13=23×32×5×7×1332760=2\times2\times2\times3\times3\times5\times7\times13=2^3\times3^2\times5\times7\times13
Answer: 32760=23×32×5×7×1332760=2^3\times3^2\times5\times7\times13.

Using prime factorization

Divisibility and trailing zeros

  • Divisibility by 10 requires both prime factors 22 and 55, since 10=2×510=2\times5.
  • Powers of 4 have only the prime factor 22: 4n=22n4^n=2^{2n}. Therefore, no positive integer power of 44 ends in zero.
HCF and LCM from prime factors
HCF⁡(a,b)=∏p∣a, p∣bpmin⁡(αp,βp),LCM⁡(a,b)=∏p∣abpmax⁡(αp,βp)\operatorname{HCF}(a,b)=\prod_{p\mid a,\,p\mid b}p^{\min(\alpha_p,\beta_p)},\qquad \operatorname{LCM}(a,b)=\prod_{p\mid ab}p^{\max(\alpha_p,\beta_p)}

For the HCF, use the smallest exponents of common primes; for the LCM, use the greatest exponents of every prime present.

HCF–LCM relation for two integers
HCF⁡(a,b)×LCM⁡(a,b)=a×b\operatorname{HCF}(a,b)\times\operatorname{LCM}(a,b)=a\times b

This product relation applies to two positive integers.

Finding HCF and LCM by prime factorization

  1. Express each number as a product of prime powers.
  2. For the HCF, multiply common primes using their smallest exponents.
  3. For the LCM, multiply every prime present using its greatest exponent.
Worked example

Find the HCF and LCM of 66 and 2020, of 9696 and 404404, and of 66, 7272 and 120120 using prime factorization.

  1. For 6 and 20, factor both numbers and take the smallest common and greatest overall powers.
    6=2×3,20=22×5;HCF⁡=2,LCM⁡=22×3×5=606=2\times3,\quad20=2^2\times5;\quad\operatorname{HCF}=2,\quad\operatorname{LCM}=2^2\times3\times5=60
  2. For 96 and 404, use their prime factorizations to find the HCF, then use the two-number product relation for the LCM.
    96=25×3,404=22×101;HCF⁡=22=4,LCM⁡=96×4044=969696=2^5\times3,\quad404=2^2\times101;\quad\operatorname{HCF}=2^2=4,\quad\operatorname{LCM}=\frac{96\times404}{4}=9696
  3. For 6, 72 and 120, use the smallest powers common to all three for the HCF and the greatest powers of all present primes for the LCM.
    6=2×3,72=23×32,120=23×3×5;HCF⁡=2×3=6,LCM⁡=23×32×5=3606=2\times3,\quad72=2^3\times3^2,\quad120=2^3\times3\times5;\quad\operatorname{HCF}=2\times3=6,\quad\operatorname{LCM}=2^3\times3^2\times5=360
Answer: For 6,206,20: HCF =2=2, LCM =60=60. For 96,40496,404: HCF =4=4, LCM =9696=9696. For 6,72,1206,72,120: HCF =6=6, LCM =360=360.
⚠ Common mistake

Do not use HCF⁡×LCM⁡=a×b\operatorname{HCF}\times\operatorname{LCM}=a\times b for three or more numbers; this identity is stated for two positive integers.

Practice

Can 4n4^n end in the digit zero for any positive integer nn?

Hint: A number ending in zero is divisible by 1010.
Key step: 4n=22n4^n=2^{2n} has no prime factor 55.
Solution: No. Since 10=2×510=2\times5 and 4n4^n contains no factor 55, it is not divisible by 1010.
Practice

Find the HCF and LCM of 1818 and 8484 using prime factorization.

Hint: Factor both numbers into prime powers, then choose the smallest and greatest exponents.
Key step: 18=2×3218=2\times3^2 and 84=22×3×784=2^2\times3\times7.
Solution: HCF⁡=2×3=6\operatorname{HCF}=2\times3=6 and LCM⁡=22×32×7=252\operatorname{LCM}=2^2\times3^2\times7=252.
Practice

Find the HCF and LCM of 88, 1212, and 3030.

Hint: Use the smallest exponents of primes common to all three for the HCF.
Key step: 8=238=2^3, 12=22×312=2^2\times3, and 30=2×3×530=2\times3\times5.
Solution: The only prime common to all three is 22, with smallest exponent 11, so the HCF is 22. The LCM is 23×3×5=1202^3\times3\times5=120.

Quick recap

  • Euclid’s division algorithm writes a=bq+ra=bq+r with 0≤r<b0\le r<b.
  • Every composite number has a unique prime factorization apart from factor order.
  • A number ending in zero must contain both prime factors 22 and 55.
  • For HCF, take common primes with their smallest exponents.
  • For LCM, take all primes present with their greatest exponents.
  • For two positive integers, HCF⁡(a,b)×LCM⁡(a,b)=a×b\operatorname{HCF}(a,b)\times\operatorname{LCM}(a,b)=a\times b.
Lecture 2

Revisiting Irrational Numbers

Reference video · Lecture 2Revisiting Irrational Numbers

Irrational Numbers and Prime Factorisation

Prime divides a square

If a prime pp divides a2a^2, then pp divides aa; this follows from the uniqueness of prime factorisation.

Prime-divisibility property
p∣a2⟹p∣ap\mid a^2\quad\Longrightarrow\quad p\mid a

Use this result when a prime divides a squared integer.

Proving Square Roots of Primes Are Irrational

Irrationality of square roots of primes

For every prime number pp, p\sqrt{p} is irrational. The proof assumes it is rational and derives a contradiction to the fraction being in lowest terms.

p∉Q\sqrt{p}\notin\mathbb{Q}

Proof by contradiction for p\sqrt{p}

  1. Assume p\sqrt{p} is rational and write it as a fraction ab\frac{a}{b} in lowest terms, with b≠0b\ne 0.
    p=ab,gcd⁡(a,b)=1\sqrt{p}=\frac{a}{b},\qquad \gcd(a,b)=1
  2. Square and rearrange to show that pp divides a2a^2, hence pp divides aa.
    pb2=a2,p∣a2⟹p∣apb^2=a^2,\qquad p\mid a^2\Longrightarrow p\mid a
  3. Substitute a=pka=pk to show that pp also divides bb.
    a=pk⟹b2=pk2⟹p∣b2⟹p∣ba=pk\Longrightarrow b^2=pk^2\Longrightarrow p\mid b^2\Longrightarrow p\mid b
  4. Both numerator and denominator are divisible by pp, contradicting that the fraction is in lowest terms.
    p∣a and p∣b⟹gcd⁡(a,b)≠1p\mid a\text{ and }p\mid b\Longrightarrow \gcd(a,b)\ne 1
Worked example

Prove that 2\sqrt{2} is irrational.

  1. Assume, for contradiction, that 2\sqrt{2} is rational and express it in lowest terms.
    2=ab,gcd⁡(a,b)=1,b≠0\sqrt{2}=\frac{a}{b},\qquad \gcd(a,b)=1,\quad b\ne 0
  2. Square and rearrange; the prime-divisibility property implies that 22 divides aa.
    2b2=a2⟹2∣a2⟹2∣a2b^2=a^2\Longrightarrow 2\mid a^2\Longrightarrow 2\mid a
  3. Put a=2ka=2k and substitute to deduce that 22 divides bb as well.
    a=2k⟹2b2=4k2⟹b2=2k2⟹2∣ba=2k\Longrightarrow 2b^2=4k^2\Longrightarrow b^2=2k^2\Longrightarrow 2\mid b
  4. This contradicts gcd⁡(a,b)=1\gcd(a,b)=1, so the assumption is false.
    2∣a and 2∣b⟹gcd⁡(a,b)≠12\mid a\text{ and }2\mid b\Longrightarrow \gcd(a,b)\ne 1
Answer: 2\sqrt{2} is irrational.
⚠ Common mistake

Do not assume the numerator and denominator are coprime without justification: reduce the fraction first, then use the contradiction with lowest terms.

Operations Involving Rational and Irrational Numbers

Rational–irrational operations

Combining a rational number with an irrational number in the stated ways gives an irrational result.

Useful irrationality properties
OperationResult
Rational ±\pm irrationalIrrational
Non-zero rational ×\times irrationalIrrational
Irrational divided by a non-zero rational, or non-zero rational divided by an irrationalIrrational

Prove an expression is irrational

  1. Assume the expression is rational.
  2. Rearrange to make the known irrational number equal to a rational expression.
  3. Use the contradiction to reject the assumption.
Worked example

Show that 5−35-\sqrt{3} is irrational.

  1. Assume that 5−35-\sqrt{3} is rational, so it can be written as ab\frac{a}{b} for integers a,ba,b with b≠0b\ne 0.
    5−3=ab5-\sqrt{3}=\frac{a}{b}
  2. Rearrange to express 3\sqrt{3} as a rational number.
    3=5−ab=5b−ab\sqrt{3}=5-\frac{a}{b}=\frac{5b-a}{b}
  3. This contradicts the irrationality of 3\sqrt{3}; therefore the assumption is false.
    3∉Q⟹5−3∉Q\sqrt{3}\notin\mathbb{Q}\Longrightarrow 5-\sqrt{3}\notin\mathbb{Q}
Answer: 5−35-\sqrt{3} is irrational.
Practice

Prove that 3\sqrt{3} is irrational.

Hint: Assume 3=ab\sqrt{3}=\frac{a}{b} in lowest terms, then use the prime-divisibility property.
Key step: From 3b2=a23b^2=a^2, deduce 3∣a3\mid a and then 3∣b3\mid b.
Solution: Assume 3=ab\sqrt{3}=\frac{a}{b} with gcd⁡(a,b)=1\gcd(a,b)=1. Then 3b2=a23b^2=a^2, so 3∣a3\mid a; write a=3ka=3k. Substitution gives b2=3k2b^2=3k^2, so 3∣b3\mid b. This contradicts gcd⁡(a,b)=1\gcd(a,b)=1, hence 3\sqrt{3} is irrational.
Practice

Show that 323\sqrt{2} is irrational.

Hint: Assume 323\sqrt{2} is rational and divide by the non-zero rational number 33.
Key step: The assumption would make 2\sqrt{2} rational.
Solution: If 323\sqrt{2} were rational, then 2=323\sqrt{2}=\frac{3\sqrt{2}}{3} would be rational. This contradicts the irrationality of 2\sqrt{2}, so 323\sqrt{2} is irrational.

Quick recap

  • A number is irrational if it cannot be written as pq\frac{p}{q} for integers p,qp,q with q≠0q\ne 0.
  • Prime factorisation is unique apart from the order of the prime factors.
  • For prime pp, p∣a2p\mid a^2 implies p∣ap\mid a.
  • For every prime pp, p\sqrt{p} is irrational; prove it by contradiction using a lowest-terms fraction.
  • A rational number added to or subtracted from an irrational number gives an irrational result.
  • Multiplying or dividing an irrational number by a non-zero rational number gives an irrational result.

Formula sheet

Euclid’s division algorithm
a=bq+r,0≤r<ba=bq+r,\qquad 0\le r<b
HCF and LCM from prime factors
HCF⁡(a,b)=∏p∣a, p∣bpmin⁡(αp,βp),LCM⁡(a,b)=∏p∣abpmax⁡(αp,βp)\operatorname{HCF}(a,b)=\prod_{p\mid a,\,p\mid b}p^{\min(\alpha_p,\beta_p)},\qquad \operatorname{LCM}(a,b)=\prod_{p\mid ab}p^{\max(\alpha_p,\beta_p)}
HCF–LCM relation for two integers
HCF⁡(a,b)×LCM⁡(a,b)=a×b\operatorname{HCF}(a,b)\times\operatorname{LCM}(a,b)=a\times b
Prime-divisibility property
p∣a2⟹p∣ap\mid a^2\quad\Longrightarrow\quad p\mid a

Mathematics — ALL CHAPTERS

1

Real Numbers

View

2

Polynomials

View

3

Pair Of Linear Equations In Two Variables

View

4

Quadratic Equations

View

5

Arithmetic Progressions

View

6

Triangles

View

7

Coordinate Geometry

View

8

Introduction To Trigonometry

View

9

Some Applications Of Trigonometry

View

10

Circles

View

11

Areas Related To Circles

View

12

Surface areas And Volumes

View

13

Statistics 

View

14

Probability

View