User:IssaRice/Faulty mathematical induction proof example: Difference between revisions
No edit summary |
No edit summary |
||
| Line 7: | Line 7: | ||
> b</math>. This closes the induction.</p></blockquote> | > b</math>. This closes the induction.</p></blockquote> | ||
This proposition is obviously false, since for <math>c = 1 > 0</math> we have <math>bc = b</math>, not <math>bc > b</math>. | This proposition is obviously false, since for <math>c = 1 > 0</math> we have <math>bc = b</math>, not <math>bc > b</math>. The problem is to figure out where the induction "proof" above goes wrong. | ||
==Diagnosis== | ==Diagnosis== | ||
Revision as of 20:45, 13 April 2020
Problem statement
Consider the following "proof":
Proposition. Let be positive integers. Then .
Proof. We fix and induct on . For the base case when , the result is vacuously true. Now suppose inductively that we have the result for . Then for we need . But since . Also, by induction hypothesis. Therefore, . This closes the induction.
This proposition is obviously false, since for we have , not . The problem is to figure out where the induction "proof" above goes wrong.