M Mahan1 Member Joined Oct 16, 2016 Messages 87 Gender Male HSC 2014 Feb 26, 2017 #2 well, the solution I came up with relies on induction, but I believe there is another way to solve it as well. Proof: prove the base case: n=2 Suppose it is true for n=k: we need to prove n=k+1: Adding to (*):
well, the solution I came up with relies on induction, but I believe there is another way to solve it as well. Proof: prove the base case: n=2 Suppose it is true for n=k: we need to prove n=k+1: Adding to (*):