0% found this document useful (0 votes)
42 views12 pages

Sample

Uploaded by

Rajesh Poluri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
42 views12 pages

Sample

Uploaded by

Rajesh Poluri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

LECTURE_01

NUMBER
S
Counting
Include
Include numbers
zero in natural
negative numbers
of natural numbers

NATURAL NUMBERS : 1, 2, 3, 4, 5, …
WHOLE 0, 1, 2, 3, 4, 5, …
NUMBERS :
INTEGERS … , -3, -2, - 0, 1, 2, 3, …
:
1,
NUMBER
INTEGERS S -2, -
… , -3, 0, 1, 2, 3, …
:
1,
RATIONAL NUMBERS : If p is any integer and q any non-zero
p
integer, then is a rational number.

l
q
5
?
-3 4 1 Ratio of integers
l

l
9 1 3 5

Numerator 
Integer
Denominator  Non-zero
Integer
RATIONAL NUMBERS
p
If p is any integer and q any non-zero integer, then is a

l
q
rational number.
Decimal form of rational number is terminating or non-terminating
&9recurring.
= 
l

4 2.25 Terminating
1 ® –
= = Non-terminating and
l

13 3.666… 3.6
recurring
4.914914 =
… 4.914
Identify Rational
Numbers
– ®
0.04 Rational
Non-terminating
number recurring
8
4.914 ® Rational number recurring
Non-terminating

2.066 ® Rational number


Terminating

0.0122547825… ® Non-terminating
Not a Rational non-recurring
number
3.1415926538… ® NotNon-terminating
a Rational non-recurring
number
2.61353029864…® NotNon-terminating
a Rational non-recurring
number
1.90357415569…® NotNon-terminating
a Rational non-recurring
number
270.253 ® Rational number recurring
Non-terminating
IRRATIONAL NUMBERS
Numbers whose decimal form is non-terminating and non-
recurring are called Irrational numbers.
These decimal numbers are
Which type of numbers
non-terminating are they?
and non-recurring

0.0122547825…

?
3.1415926538…
2.61353029864…
1.90357415569…
IRRATIONAL NUMBERS
Numbers whose decimal form is non-terminating and non-
recurring are called Irrational numbers.

LetsThese
Thefind decimal
square roots
square numbers
root are that are not perfect
ofofnumbers
numbers
non-terminating
squares
that are not and non-recurring
are perfect
Irrational numbers.
squares

2 = 1.414213562373…

3 = 1.732050807568…

5 = 2.236067977499…

6 = 2.449489742783…
REAL
NUMBERS
RATIONAL IRRATIONAL
NUMBERS
Integer Terminating or NUMBERS
Non-terminating
Non-terminating Non-recurring
Non-zero
recurring
integer

INTEGERS : …, -2, -1, 0, 1, 2, …

WHOLE NUMBERS : 0, 1, 2, 3, …

NATURAL NUMBERS : 1, 2, 3, 4,

EUCLID’S=DIVISION
DIVIDEND DIVISOR ×ALGORITHM
QUOTIENT + REMAINDER
For two given positive integers a andthere
b exist unique integers q and r
satisfyinga = bq + r; 0 < r < b

DIVISOR
Example 1 :8 ÷ 2 DIVIDEND Example 2 :15 ÷ 2
2) 8 (4 QUOTIENT 2 ) 15 (7
- 8 - 14
0 REMAINDER 1
8 = 2 × 4 + 0 15= 2 × 7 + 1
a = b × q + r a = b × q + r
Exercise
1.1
Use Euclid’s division algorithm to find the HCF
Q.1 (i)
of : 135 and 225

Sol Since 225 > 135,


. Applying Euclid’s Division Algorithm,
we get,
225 = 135 × 1 + 90 1
Now consider,divisor 90 and dividend 135 135) 225
Dividend =
applying Euclid’s Division Algorithm, - 135
we get, Divisor × Question +
Reminder 90 ) 135( 1
135 = 90 × 1 + 45 - 90
Now consider, divisor 45 and dividend 90 45 ) 90 ( 2
applying Euclid’s Division Algorithm, - 90
Now, the divisor in 0
we get,
this
90 = 45 × 2 + 0
division is required
since remainder= 0
HCF of 225 & 135
\ HCF (135, 225)= 45
Exercise
1.1
Use Euclid’s division algorithm to find the HCF
Q.1 (iii)
of : 867 and 255
Divide, 867 by
Sol Since 867 > 255, 255 3
. Applying Euclid’s Division Algorithm,
Dividend =
we get, Divisor × Question +
255) 867
Reminder - 765
867 = 255 × 3 + 102
102) 255( 2
Now consider,divisor 102anddividend 255
- 204
applying Euclid’s Division Algorithm,
we get, 51) 102 (2
- 102
255 = 102 × 2 + 51 0
Now consider, divisor 51 and dividend 102
applying Euclid’s Division Algorithm,
Now, the divisor in
we get,
this
102 = 51 × 2 + 0
division is required
since remainder= 0
HCF of 867 & 255
\ HCF (867, 255)= 51
Thank You

You might also like