Thursday, December 24, 2015

elementary number theory - Prove by induction that 3n+7n2 is divisible by 8 for all positive integers n...

Prove by induction that 3n+7n2 is divisible by 8 for all positive integers n.



So far I have the base case completed, and believe I am close to completing the proof itself.




Base case:(n=1)



31+712=8/8=1



Inductive Hypothesis: Assume that 3n+7n2 is divisible by 8 for all positive integers n.



Induction step (n+1) case:



3n+1+7n+12




3(3n)+7(7n)2



3n+7n=8x



-It seems to me that this could be the end of the proof because whatever the answer is would be a multiple of 8: but I am unsure, any help is appreciated.

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...