x 2n – y2n is divisible by x + y.
x 2n – y2n is divisible by x + y.
Let P(n) = x 2n – y2n
P(1) = x2 – y2
= (x + y) (x-y) which is divisible by (x+y)
Let us assume P(k) is true
TO Prove P(k+1) is divisible by (x+y) using the resultsof A
P(k +1) = x2(k+1) – y2(k+1)
P(k+1) = x2(k+1) – y2(k+1)
= x2k . x2 – y2k . y2
= x2k . x2 – [ x2k – m(x+y)]y2 From result A
= x2k . x2 – y2.x2 + my2 (x+y)
= x2k (x2 – y2) + my2 (x+y)
y2k = x2k - m(n+y)
= (x+y) { x2k (x-y) + my2}
P(k+1) is divisible by (x+y)
hence the result.
P(K+1) is true.
By the Principle of mathematical induction, P(n) is true for all values of nwhere n
N
Hence proved
AI is thinking…
Couldn't generate an explanation.
Generated by AI. May contain inaccuracies — always verify with your textbook.