Quote:
Originally Posted by Matt L
<>
In the specific case, the question is "prove or disprove." The first step, of course, is to decide if the theorem can possibly be correct. Of course it cannot, because n=3 disproves it. IN GENERAL.
There is absolutely no need to go through such machinations that you are attempting.
|
This approach shows a problem with relying a specific counterexample being quickly identifiable (or unidentifiable). Using the approach of "the first step is to decide if the theorem can possibly be correct. Of course it cannot, because..."
What if you start with n=2? Can it possibly be correct? Yes. 8? Yes. 32? Yes. 488? Yes. 3? No.
What if there are no "disprove" questions on the final?