Maths

Project
Work
Real
1

Real Numbers

1.1(Euclids Division Lemma) :

itive integers a and b, there exist unique
and r satisfying a = bq + r,0 r < b.
division algorithm is a technique to
the Highest Common Factor(HCF) of
positive integers. Recall that the HCF
sitive integers a and b is the largest
nteger dthat divides both a and b.
e how the algorithm works, through an example first
o find the HCF of the integers 455 and 42. We start
eger, that is,455. Then we use Euclids lemma to get
10+ 35Now consider the divisor 42 and the remai
y the division lemma to get42=35 1 +7Now cons
and the remainder 7, and apply the division lemma
=7 5 +0
3

t the remainder has become zero, and we cannot pr

e claim that the HCF of 455 and 42 isthe divisor at t
, 7. You can easily verify this by listing all the factors
hy does this method work? It works because of the f
let us state
division algorithm clearly.
the HCF of two positive integers, say c and d, with c
steps below:
Apply Euclids division lemma, to c and d. So, we fin
q and rsuch that c = dq + r, 0 r< d.
r= 0, dis the HCF ofc and d. Ifr0, apply the div
dand r.
Continue the process till the remainder is zero. The d
will be the required HCF.
ithm works because HCF (c, d) = HCF (d,r) where t
4
) denotes the HCF ofc and d,etc.

1 :
s algorithm to find the HCF of 4052 and 12576.
Step 1 : Since 12576 > 4052, we apply the division
4052, to get
12576=4052 3 + 420
nce the remainder 420 0, we apply thedivision le
420, to get
4052=420 9 + 272
We consider the new divisor 420 and the new remain
the division lemma to get
420 =272 1 +148
er the new divisor 272 and the new remainder 148,
n lemma to get
272 =148 1 +124
er the new divisor 148 and the new remainder 124,
5
n lemma to get

148 =124 1+ 24
er the new divisor 124 and the new remainder 24, a
n lemma to get124=24 5 +4We consider the new
w remainder 4, and apply the division lemma to get
24=4 6 +0
nder has now become zero, so our procedure stops.
his stage is 4, the HCF of 12576 and 4052 is 4.

1.2(Fundamental Theorem of Arithmetic) :

mposite numbercan be expressed(factorised)as a p
d this factorisation is unique, apart from the order in
factors occur.

HCF(6, 20) = 21=Product of the smallest power o

prime factor in the numbers.
) = 22 31 51=Product of the greatest power
tor, involved in the numbers.
2

1.3-Let p be a prime number. If p divides a, then p d

a positive integer.

4-Let x be rational number whose decimal expansion

x can be expressed in the form p/q, where p and q a
me factorisation of q is of the form 2n x 5m, where n
ve numbers.

5-Let x =p, q be a rational number, such that the pr

on of q is of the form 2n x 5m, where n, m are non-n
hen x has a decimal expansion which terminates. 7

Polynomi
als
8

al:
atics, a polynomial is an expression of finite length
d from variables (also called indeterminates) and co
the operations of addition, subtraction, multiplicatio
ve integer exponents. For example, x2 x/4 + 7 is
l, but x2 4/x + 7x3/2 is not, because its second te
vision by the variable x (4/x), and also because its t
n exponent that is not an integer (3/2).

p(x) is a polynomial in x, the highest power ofx in

degree ofthe polynomial p(x). For example, 4x+
mial of degree 1 is called a linear polynomial. For

mial of degree 2 is called a quadratic polynomial.

has been
derived from the word quadrate, which m
2
9
x+ 3x + 4

al of degree3 is calleda cubic polynomial.

3
x+5

olynomial in x, and ifkis any real number, then the

replacing x by k inp(x), is called the value ofp(x)
ed byp(k).

number kis said to be a zero of a polynomial p(x

ofp(x) =ax+ b, thenp(k) =ak+b= 0, i.e., k= -b/a

of the linear polynomial ax+ b is b/a:
Constant term)/ Coefficient of x

polynomial can have at most 2 zeroes and a cubic p

most 3 zeroes.
10

are the zeroes of the quadratic polynomial ax2+bx+

+ =-b/a , = c/a
re the zeroes of the cubic polynomial ax3+bx2+cx+
+ + = -b/a, ++ = c/a, = -d/a

n algorithm states that given any polynomial p(x) a

olynomial g(x), there are polynomials q(x) and r(x)
p(x) = g(x) q(x)+ r(x),
r(x)= 0 or degree r(x) < degree g(x).
3
2
Divide 3x x 3x+
5 byx 1 x2, and verify the div

:Note that the given polynomials are not in standard

division, we first write both the dividend and divisor
g orders of their degrees.
11

dend = x3+3x23x+ 5 and

= x2+x 1.
process is shown on the right side.
here since degree
< 2 = degree (x2+x 1).
ient =x - 2, remainder = 3.

or linear polynomial:
y= 2x + 3
X-axis

-2

-3/2

Y-axis

-1

12

for quadratic polynomial:

x2 3x - 4

X-axis

-2

-1

Y-axis

-4

-6

-6

-4

13

h of cubic polynomial:
x3 4x
X-axis

-2

-1

Y-axis

-3

14