26.5.3 The Two Steps of Induction
Core ideaFirst check that n=1 holds (the base case), then prove that if n=k holds, so does n=k+1
Module goal. Provide a rigorous proof tool for statements that must hold for every positive integer n, circling back to the general terms and sum formulas found earlier.