Open main menu
Home
Random
Log in
Settings
About Conservapedia
Disclaimers
Conservapedia
Search
Changes
← Older edit
Newer edit →
Proof by induction
(view source)
Revision as of 13:21, August 22, 2008
28 bytes added
,
13:21, August 22, 2008
no edit summary
Line 28:
Line 28:
<math>1 + 2 + 3 + ... + n + (n+1)= \frac{n(n+1)}{2} + (n+1)\quad|</math>simplify the right side<br>
<math>1 + 2 + 3 + ... + n + (n+1)= \frac{n(n+1)}{2} + (n+1)\quad|</math>simplify the right side<br>
<math>\Leftrightarrow</math><br>
<math>\Leftrightarrow</math><br>
−
<math>\frac{n(n+1)}{2} + \frac{2(n+1)}{2}=\frac{n(n+1)+2(n+1)}{2}=\frac{(n+1)(n+2)}{2}</math><p>
+
<math>
1 + 2 + 3 + ... + n + (n+1)=
\frac{n(n+1)}{2} + \frac{2(n+1)}{2}=\frac{n(n+1)+2(n+1)}{2}=\frac{(n+1)(n+2)}{2}</math><p>
Now, we're finished: the hypothesis A hold for all the Natural Numbers.
Now, we're finished: the hypothesis A hold for all the Natural Numbers.
DiEb
78
edits