✔ 最佳答案
It is easy, you can give a counter example, then you statement will be proved.
Say 2^n-1 is a complete cubic or square of a number.
Take n=2
2^2-1=3, where 3 is not a complete cubic or square of a number. There is contradiction.
Then 2^n-1 is not a complete cubic or square of a number.
This is called prove by contradiction, assume it is correct and use a counter example to disprove it.
2008-02-01 16:51:36 補充:
This is the general methol to disprove a statement. Any counter example can disprove it. If anf only if all of the assumption was valid to prove the statement is true. In a easiler way to say, we need all crroect to prove a statement true, while 1 counter example can disprove it.
2008-02-01 16:53:01 補充:
So I take n=2 as example, you can take n=1 and start your prove like by MI, sayn=1, 2^n-1 = 1, then assume iti is true for a number k.
2008-02-01 16:54:59 補充:
2^k-1 = c where c is either a complete cubic or square of a number.Then prove for k 12^(k 1)-1=dLHS=2 (2^k-1) 1=2c 1, so we need to prove 2c 1 is a cubic or square of a number or not.
2008-02-01 16:55:29 補充:
Then you will find it is difficult to prove it true or not.
2008-02-01 16:56:27 補充:
So, we take a counter example is the most easiest way to disprove any statements.
2008-02-01 16:57:51 補充:
This is prove by contradiction. 1 COUNTER EXAMPLE IS ENOUGH. You need to get all correct only in the case of proving a statement true.