3 ms·
What you're missing is that "n horses have the same color" is true for n=1. So therefore we should be able to invoke the induction to bigger and bigger numbers
by Dylan16807 5y ago
What you're missing is that "n horses have the same color" is true for n=1. So therefore we should be able to invoke the induction to bigger and bigger numbers.
If the induction actually was valid for 1->2, we'd have a hell of a problem.
- wruza 5y agoNow I think I understand the subtlety, thanks! The induction part is important here because we start from n=1 (where the assumption is not as obviously questionable as for n in general, because it’s coincidentally/degeneratively true in relation to our reasoning) and then the “base error” allows us to generalize into a bigger mistake.