For all integers n≥0, 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=4m−1 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