Mathematical induction :
Posted June 11th, 2009 by alpha
Let
be an integer.
and
are the roots of the equation
.Using mathematical induction prove that
is - (1)an integer
2)not divisible by p
- Login or register to post comments
- Printer-friendly version
Comments
I've solved the first part
I've solved the first part of the question.Please solve the second part.
````Maths````
000
(((())))
///
Second part -- please take a look at my procedure
Let P(n) be the statement which is to be proved.
From eqn (1)
STEP1-
is not divisible by p.
P(1) is true.
To prove that P(2) is true.

----------This is not divisible by p.
=
STEP2 --- { INDUCTION ASSUMPTION }
is not divisible by p. .............. (3)
Let P(k) and P(k-1) be true.
STEP3-
is not divisible by p.
=

, so
is not divisible by p [from (3)]
is not divisible by p [from (3)]
is not divisible by p [from (4)]
To prove that P(k+1) is true.
To prove that
=
=
--->
and
But it isn't necessary that the difference between two integers which aren't divisible by p , should not br divisible by p. HERE LIES THE PROBLEM.
isn't divisible by p.
Please help in in proving
````Maths````
000
(((())))
///
answer
a,b are roots.
modulo p
This sequence is periodic with period 6 and none of its values are 0 mod p
~~THANK YOU ~~
````Maths````
000
(((())))
///