RighteousRhino
New member
- Joined
- Sep 24, 2015
- Messages
- 1
Discrete Math Induction Proof Prove that 2^n + (-1)^(n+1) is divisible by 3 for n>0
Prove that 2^n + (-1)^(n+1) is divisible by 3 for all positive integers (n>0) using induction or strong induction.
My attempt using induction:
Base case: n = 1: 2^1 + (-1)^(1+1) = 2 +1 = 3 and 3 is divisible by 3.
inductive step: Assume that for any k > 0 2^k + (-1)^(k+1) is divisible by 3, we must prove that 2^(k+1) + (-1)^(k+1+1) is divisible by 3.
2^(k+1) + (-1)^(k+1+1) = 2*2^k + (-1)^(1) * (-1)^(k+1) = 2*2^k - (-1)^(k+1)
This is where i get stuck... if it wasn't for that 2 and the minus sign I could relate it to the initial assumption.
Any help would be greatly appreciated.
Prove that 2^n + (-1)^(n+1) is divisible by 3 for all positive integers (n>0) using induction or strong induction.
My attempt using induction:
Base case: n = 1: 2^1 + (-1)^(1+1) = 2 +1 = 3 and 3 is divisible by 3.
inductive step: Assume that for any k > 0 2^k + (-1)^(k+1) is divisible by 3, we must prove that 2^(k+1) + (-1)^(k+1+1) is divisible by 3.
2^(k+1) + (-1)^(k+1+1) = 2*2^k + (-1)^(1) * (-1)^(k+1) = 2*2^k - (-1)^(k+1)
This is where i get stuck... if it wasn't for that 2 and the minus sign I could relate it to the initial assumption.
Any help would be greatly appreciated.