38c8f56a868203ba1a56a420d9695acc
38c8f56a868203ba1a56a420d9695acc
CLASS 10TH
@mathswithrishi
Objectives
EUCLID’S DIVISION LEMMA
ALGORITHM
LEMMA
EUCLID’S DIVISION ALGORITHM
The Fundamental Theorem of Arithmetic
PRIME FACTORISATION METHOD TO FIND HCF AND LCM
RATIONAL NUMBERS
IRRATIONAL NUMBERS
RATIONAL NUMBERS AND THEIR DECIMAL EXPANSIONS
@mathswithrishi
EUCLID’S DIVISION LEMMA
Given positive integers a and b, there exist unique integers q and r satisfying a =
bq + r, where
0£r<b.
Here we call ‘a’ as dividend, ‘b’ as divisor, ‘q’ as quotient, and ‘r’ as remainder.
\ Dividend = (Divisor x Quotient) + Remainder
If in Euclid’s lemma r = 0 then b would be HCF of ‘a’ and ‘b’.
@mathswithrishi
NATURAL NUMBERS
Counting numbers are called natural numbers i.e. 1, 2, 3, 4, and 5, are natural
numbers.
WHOLE NUMBERS
All counting numbers/natural numbers along with 0 are called whole numbers
i.e. 0, 1, 2, 3, 4, 5
……………. are whole numbers.
INTEGERS
All natural numbers, negative of natural numbers and 0, together are called
integers.
i.e. ………. – 3, – 2, – 1, 0, 1, 2, 3, 4, are integers.
@mathswithrishi
ALGORITHM
An algorithm is a series of well-defined steps that gives a procedure for
solving a type of problem.
LEMMA
A lemma is a proven statement used for proving another statement.
@mathswithrishi
EUCLID’S DIVISION ALGORITHM
@mathswithrishi
To obtain the HCF of two positive integers, say a and b, with a >
b, follow the steps below:
Step 1 : Apply Euclid’s division lemma, to a and b. So, we find whole numbers,
q, and r such that a = bq + r, 0 £ r < b.
Step 2 : If r = 0, b is the HCF of a and b. If r ¹ 0 apply the division lemma to b
and r.
Step 3: Continue the process till the remainder is zero. The divisor at this stage
will be the required HCF.
This algorithm works because HCF (a, b) = HCF (b, r) where the symbol HCF (a,
b) denotes the HCF of a and b, etc.
@mathswithrishi
The Fundamental Theorem of Arithmetic
@mathswithrishi
@mathswithrishi
PRIME FACTORISATION METHOD TO FIND HCF AND
LCM
@mathswithrishi
Q.Find the LCM of 20 and 12 by the prime
factorization method.
Solution:
Step 1: To find LCM of 20 and 12, write each number as a product of prime factors.
20 = 2×2×5 = 22×5
12 = 2×2×4 = 22×4
Step 2: Multiply all the prime factors with the highest degree.
Here we have 2 with the highest power 2 and other prime factors 3
and 5. Multiply all these to get LCM.
@mathswithrishi
Q.Find the HCF of 20 and 12 by the prime factorization
method.
Solution:
Step 1: To find the HCF of 20 and 12, write each number as a product of
prime factors.
20 = 2×2×5 = 22×5
12 = 2×2×4 = 22×4
Step 2: Multiply all the prime factors with the lowest degree.
Here we have only 2 as a common prime factor with the
lowest power of 2.
@mathswithrishi
RATIONAL NUMBERS AND THEIR DECIMAL
EXPANSIONS
@mathswithrishi
Theorem 1: If m be any rational number whose decimal expansion is
terminating in nature, then m can be expressed in form of p/q, where p
and q are co-primes and the prime factorization of q is of the form 2 x5y,
where x and y are non-negative integers.
@mathswithrishi
Theorem 3: If m is a rational number, which can be represented as the
ratio of two integers i.e. p/q and the prime factorization of q does not
take the form 2x5y, where x and y are non-negative integers. Then, it can
be said that m has a decimal expansion which is non-terminating
repeating (recurring).
Consider the following examples:,
@mathswithrishi
The End
@mathswithrishi