WELCOME TO

MY SMART CLASS
BY PRABHAKAR KATTA

ZPHS TEKULSOMARAM

VALIGONDA
 REAL NUMBERS
NATURAL NUMBERS (N)={1,2,3,4,5……….} Numbers which are used to
counting or ordering in common are called Natural numbers.

WHOLE NUMBERS(W)={0,1,2,3,4,5…….}
Whole Numbers are the set of natural numbers along with the number 0. This set of whole numbers is
denoted by the symbol W.

INTEGERS (Z)={……-3,-2,-1,0,1,2,3…..}
the set of integers includes zero, set of whole numbers, set of natural numbers (also called counting numbers)
and their additive inverses (-1,-2,-3,-4,-5,..).

RATIONAL NUNBERS (Q) ={2/5,-7/3,0,-9,7/8…….}

A number which is in the form of p/q or which can be expressed in the form of p/q, where q is not equal to
zero is called a rational number.

IRRATIONAL NUMBERS(Q` or S)={√2,√3,√5,0.325678901256…},

 the number that cannot be represented as a simple fraction. It cannot be expressed in the form of a ratio,
such as p/q, where p and q are integers, q≠0 is called Irrational number.
IRRATIONAL NUMBERS and RATIONAL together are called REAL
NUMBERS
Every rational number can be written as a fraction

let the simplest form of a rational number = p/q

Here p and q are co-primes and q≠0

Co-prime numbers

Two numbers are called “co-prime numbers” If their H.C.F. is “1”

Co-primes have NO common factor other than “1”

Co-primes have only one common factor that is “1”

Theorem

a is a positive integer and p is a prime number.

“If a2 is divided by p then a is also divided by p” If 3‌² is divided by 3 then 3 also

divided by 3
Division algorithm

Dividend(a) = Divisor(b) x Quotient(q) + Remainder(r)

a=bq + r

If remainder(r) is “0”

a=bq

we said that "b divides a"

In this case:

“a” is the multiple of “b” and “q”

“b” and “q” are called factors of “a”

Contradiction Method
In this method, we take an assumption that “opposite to given statement”
After several steps, we get mathematical contradiction(unreasonable statement)
Reason for this contradiction is our assumption.
So our assumption is wrong
We conclude that given statement is correct.
EUCLID’S DIVISION LEMMA :-Given positive integers a and b there exists unique pair of integers q and r
satisfying a=bq + r , 0 ⩽ r < b

Euclid's division algorithm is a technique to

compute the highest common factor (H.C.F) of
two given numbers.

Example:-Find the H.C.F of 550 and 300 Using Euclid’s division algorithm.

Solution:- 550=300 ✖ 1 +250 ( a=bq+r)

300=250 ✖ 1 + 50

250=50 ✖ 5 + 0

∴ H.C.F (550,300) =50