- #1
RichardParker
- 23
- 0
When proving by smallest counterexample, you assume an integer k>1 where it is the smallest integer for which statement Sn is false. Then you proceed to prove that Sk-1 implies Sk. Where you deduce a contradiction by which k is true.
Can't you prove this directly by assuming Sk-1 is true and showing that Sk-1 implies Sk since you will end up with a true k anyhow?
Can't you prove this directly by assuming Sk-1 is true and showing that Sk-1 implies Sk since you will end up with a true k anyhow?