Proof Writing & Problem SolvingEasy
Proof Writing & Problem Solving · Easy problem
A strong induction proves every amount of cents or more can be paid with -cent and -cent stamps, using the step "amount = (amount ) + one -cent stamp". How many base cases must be checked directly for this step to reach every amount from on?