There are different ways of proving a mathematical theorem.
Proof by InductionEdit
One type of proof is called proof by induction. This is usually used to prove a theorem that is true for all numbers. There are 4 steps in a proof by induction.
1. State that the proof will be by induction, and state which variable will be used in the induction step.
2. Prove that the statement is true for some beginning case.
3. Assume that for some value n = n0 the statement is true and has all of the properties listed in the statement. This is called the induction step.
4. Show that the statement is true for the next value, n0+1.
Once that is shown, then it means that for any value of n that is picked, the next one is true. Since it's true for some beginning case (usually n=1), then it's true for the next one (n=2). And since it's true for 2, it must be true for 3. And since it's true for 3, it must be true for 4, etc. Induction shows that it is always true, precisely because it's true for whatever comes after any given number.
An example of proof by induction:
Prove that for all natural numbers n, 2(1+2+3+....+n-1+n)=n(n+1)
Proof: First, the statement can be written "for all natural numbers n, 2 =n(n+1)
By induction on n,
First, for n=1, 2 =2(1)=1(1+1), so this is true.
Next, assume that for some n=n0 the statement is true. That is, 2 = n0(n0+1)
Then for n=n0+1, 2 can be rewritten 2(n0+1) + 2
Since 2 = n0(n0+1), 2n0+1 + 2 = 2(n0+1) + 2n0(n0+1)
So 2(n0+1) + 2n0(n0+1)= 2(n0+1)(n0 + 2)
Proof by ContradictionEdit
Proof by contradiction is a way of proving a mathematical theorem by showing that if the statement is false, there is a problem with the logic of the proof. That is, if one of the results of the theorem is assumed to be false, then the proof does not work.
When proving a theorem by way of contradiction, it is important to note that in the beginning of the proof. This is usually abbreviated BWOC. When the contradiction appears in the proof, there is usually an X made with 4 lines instead of 2 placed next to that line.