Re:All Horses Are the Same Color
by jstanley on Sunday December 05, 2021 @02:43AM
(#29447549)
I thought the same thing as you at first, but you need to read more carefully.
The proof is showing that it is true for n=1, and then showing that if it is true for n (the part where we "suppose it is") then it is true for n+1, proving by induction that it is true for all n >= 1.
The proof is showing that it is true for n=1, and then showing that if it is true for n (the part where we "suppose it is") then it is true for n+1, proving by induction that it is true for all n >= 1.