POWER POINT
PRESENTATION
FOR
CLASS X MATHEMATICS
SATHEESH KUMAR K
TGT, AECS-5,MUMBAI
CHAPTER 1
REAL NUMBERS
TOPICS
Euclid's Division Lemma.
The fundamental theorem of
Arithmetic.
Revisiting irrational numbers.
Revisiting rational numbers and
their decimal representation.
HIGHEST COMMON FACTOR(HCF)
HCF of (two positive
integers a and b)is the
largest positive integer that
divides both a and b
Euclid’s division
algorithm is a technique to
find the HCF of two given
positive integers
Euclid’s division
algorithm is based on
Euclid’s Division Lemma.
A lemma is a proven
statement used for proving
another statement.
An algorithm is a series
of well defined steps which
gives a procedure for
solving a type of problem.
EUCLID’S DIVISION LEMMA
Given positive integers a and
b, there exist unique integers
q and r satisfying
a = bq + r, 0≤ r< b
An example to see how the algorithm works.
Find the HCF of the numbers 404 and 96.
Start with the larger integer, that is 404 Use
Euclid’s lemma to get
404=96 X 4 +20
Now apply the division lemma to divisor 96
and remainder 20.
96 =20 x4+16
Now consider divisor 20 and remainder 16
20 =16 x 1+4
Now consider divisor 16 and remainder 4
16= 4 x4 +0
Notice that remainder
becomes 0, and we cannot
proceed further. We claim
that the HCF of 404 and 96
is the divisor at this stage
i.e 4.
This Lemma has several
applications related to finding
properties of numbers.
For example, show that any
positive odd integer is of the
form 6q+1,or 6q+3 or
6q+5,where q is any integer.
Let a be any positive integer
and b=6 .Then by Euclid’s
algorithm, a = 6q+r for some
integer
q≥0,r=0,1,2,3,4or5,because
0≤r<6.
So a=6q,6q+1,6q+2,6q+3,6q+4
or 6q+5.
If a is of the form 6q( = 2 X 3q),then a
is an even integer. Also a positive
integer can be either even or odd.
Therefore any positive odd integer is
of the form 6q+1,6q+3 or 6q +5
( Please remember that sum of any
positive even integer and a positive
odd integer is always odd.).
QUESTIONS FOR PRACTISE
1) Find the HCF of 1024 and 420
by Euclid’s Division Lemma.
2) Find the HCF of 4096 and 384
by Euclid’s division lemma.
3) Use Euclid’s division lemma to
show that the square of any
positive integer is of the form 3m
or 3m+1,for some integer m.
THE FUNDAMENTAL
THEOREM OF ARITHMETIC
Every composite
number can be
expressed (factorised)
as a product of primes,
and this factorization
is unique.
The method of finding the HCF and
LCM of two positive numbers by the
prime factorization method.
Example: Find HCF and LCM of 108 and 150
108 =2² X 3³ and 150 =2 X 3 X 5²
HCF(108,150) =2 X3 = Product of SMALLEST
power of each common prime factor in the
numbers.
LCM(108,150)= 2² X 3³ X5² = Product of
GREATEST power of each common prime
factor in the numbers.
Notice that
HCF(108,150) X LCM(108,150)= 108 X150
For any two positive integers
a and b,
HCF (a,b) X LCM(a,b) = a X b
This result can be used to find
the LCM of two numbers.
REVISITING IRRATIONAL NUMBERS
In this section, we will prove that numbers of the
form √p are irrational where p is a prime.
Example: Prove √2 is irrational.
Proof: Assume √2 is rational. Then √2 =a/b ,where
a and b are co-prime and b≠ 0.
Squaring both sides, we get
2b² = a² , i.e. 2 divides a²,implies 2 divides a.
Let a=2c.Then , substituting for a, we get
2b²=4c² i.e.b² = 2c²
This means that 2 divides b²,and so divides b.
Therefore, a and b have at least 2 as a common
factor. This contradicts the fact a and b have no
common factors other than 1.
So, we conclude that √2 is irrational. Similarly,
we can prove that √3 ,√5 etc are irrational.
Example: Show that 3 − √5 is irrational.
Proof: Assume 3 − √5 is rational. Then 3 − √5=a/b,
where and b are co-prime,b≠0.
Rearranging the equation, we get
√5=3 − (a/b) = (3b − a)/b
Since a and b are integers (3b − a)/b is rational,
and so , √5 is rational.
This contradicts the fact that √5 is irrational.
Therefore, our assumption is wrong.
REVISITING RATIONAL NUMBERS AND THEIIR DECIMAL
REPRESENTATION .
Theorem 1: Let x be a rational number whose
decimal expansion terminates. Then ,x can be
expressed in the form p/q, where p and q are co-
prime ,and the prime-factorisation of q is in the
form 2n5m where n and m are non-negative
integers.
Example : 0.107 = 107/1000= 107/(2³ x 5³ )
Example: 7.28 = 728/100 = 728 / 10²
THEOREM 2
Let x = p/q be a rational number such that prime
factorisation of q is of the form 2n5m where n and
m are non-negative integers. Then x has a
decimal representation that terminates.
Example: 3/8 = 3/2³ = 0.375
Example: 13/250=13/ 2 x 5³ = 0.052
THEOREM 3
Let x=p/q ,where p and q are co-
primes be a rational number
such that prime factorisation of
q is not of the form 2n5m ,where
n and m are non-negative
integers. Then ,x has a decimal
expansion which is non-
terminating repeating.
QUESTIONS FOR PRACTISE
Prove that 2 + 5√2 is an irrational number.
Find the HCF and LCM of 180 and 324 and
verify that HCF X LCM =Product of given
numbers.
Without actually performing long division, state
whether the following rational numbers will have
a terminating decimal representation or a non-
terminating repeating decimal representation.
13/50 , 45/343 , 17/3125
THANK YOU
