Thursday, June 15, 2017

elementary number theory - Prove that 4n+1 is not divisible by 3

For all integers n0, prove that the value 4n+1 is not divisible by 3.



I need to use Proof by Induction to solve this problem. The base case is obviously 0, so I solved 40+1=2. 2 is not divisible by 3.




I just need help proving the inductive step. I was trying to use proof by contradiction by saying that 4n+1=4m1 for some integer m and then disproving it. But I'd rather use proof by induction to solve this question. Thanks so much.

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