PRESENTED BY:

MOHIT RASTOGI
TGT- MATHS
1. NATURAL NUMBER (N)
2. WHOLE NUMBER (W)
3. INTEGERS ( I OR Z )
4. RATIONAL NUMBER (Q)
5. IRRATIONAL NUMBER (Q*)
6. REAL NUMBER (R)
NATURAL NUMBER : All counting numbers are
known as natural number .
Natural number start from 1 and move
to infinity .
It is denoted by N.
N = { 1,2,3,4,--------------- }

WHOLE NUMBER : All natural numbers
including zero are known as Whole Numbers.
It is denoted by W.
W= { 0,1,2,3,4,5,6,------------,}

INTEGERS : Move - to +.
It is denoted by z.
Z={-,.-2,-1,0,1,2,3,+}
Negative integers (Z):-1,-2,..,-
positive integer (Z
+
):
1,2,3,,
RATIONAL NUMBER: (i) The number in the
form of p/q , where p,q
are integers and q0 and p,q both are coprime .
(ii)- All terminating decimal number are
called rational numbers.
Number is terminating decimal if
the denominator is in the form of
25.
(iii)- All non terminating recurring
(repeating) decimal numbers are known
as rational number.
e.g.- 1/3=0.3333..
IRRATIONAL NUMBER :Numbers which
is not rational is known as
irrational numbers.
(i)- All non terminating non recurring decimal
numbers are known as irrational numbers.
(ii)-Number lie in side the redical sign whose
square root (or nth root) is not possible.
is known as isrational number.

REAL NUMBER: All irrational
and rational numbers
are simultaneously known
as Real Numbers.
RATIONAL IRRATIONAL

INTEGERS

WHOLE

NATURAL

For any two positive integers
a & b where a>b, there exist
two unique positive integers
q & r such that:
a=bq+r , 0 r <b .
To find the HCF of two positive integer a & b.
For any two positive integer a & b
there exist two unique positive integers
a & b.
Apply Euclids division lemma,
a=bq+r , 0r<b .
Steps of algorithm are as follows:
(i) If r=0, b is HCF of a & b. If r does not zero
go to next step.
(ii) Taking b & r repeat steps (i) & (ii) till r=0.
(1). Use Euclids division lemma find HCF of
132 and 770.
(2). Show that any positive odd integer is in the
form of 8q+1, 8q+3, 8q+5, 8q+7 for some
integer q.
(3) Use Euclids division lemma to show that
the square of any positive integer is either
in the form of 3m or 3m+1 for some integer
m.
LEMMA: It is a proven statement which is use
to prove another statement.
OR
It is a theorem which is already drive
and use to drive another theorems.


ALGORITHM: It involve the steps required for
solving the problems.
PRIME NUMBERS: The numbers which have only
two factors first is 1 and
second is number itself.
e.g.- 2,3,5,7,
COMPOSITE NUMBERS : The numbers which
have more than two factor
is known as composite
numbers.
e.g.- 4,6,8,9,10, ..
All composite numbers can be expressed
( factorise ) as a product of prime factors,
and their factors are unique, except the
order the factors occur.
HCF: Product of lowest power of all common
prime factor of numbers.
LCM: Product of greatest power of all prime
factor of numbers.
[ HCF(a,b) LCM(a,b) = ab ]

(1). If HCF(66,138)=6 ,then find LCM(66,138).
(2).Show that 6 never end with unit digit 0 for
any positive integer r.
(3) Show that 123456+5 is a
composite number.
(1) Prove that 2 is an irrational number.
(2). Prove that 3 is an irrational number.
(3). Prove that 5 is an irrational number.
(4). Prove that 2+33 is an irrational number.
(5). Prove that 3-25 is an irrational number.
(6). Prove that 1/(2-3) is an irrational
number.







THANKS