Tuesday, May 17, 2016

polynomials - Prove an+1 is divisible by a+1 if n is odd

Prove an+1 is divisible by a+1 if n is odd:



We know a cannot be 1 and the nN.
Since n must be odd, we can rewrite n as 2k+1. Now we assume it holds for prove that it holds for the next term.



a2(k+1)+1+1


=a2k+3+1

=a3a2k+1

=(a3+1)a2ka2k+1




Im not sure on what to do next. Since a2k means that the exponential term will be even and thus you cant use the fact that an+1 is divisible by a+1 if n is odd.

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...