samehsameh
Regular
He doesnt need to justify everything if its obvious. If people had to justify things that had already been proven, then proofs would be so much longer.
\( {\text{Need to show that }}\sum\limits_{i = 1}^n i = \frac{{n(n + 1)}}{2}. \)
\( {\text{Let }}n{\text{ be some small value, say 5}}{\text{.}} \)
\(
{\text{Then}} \hfill \\
\)
\(
2\sum\limits_{i = 1}^n i = 2\sum\limits_{i = 1}^5 i = \sum\limits_{i = 1}^5 {2i} = 2 + 4 + 6 + 8 + 10 \)\( = (n - 3) + (n - 1) + (n + 1) + (n + 3) + 2n = 6n \hfill \\
\)
\( {\text{We already said }}6 = (n + 1){\text{, in the expansion so}} \)
\( 6n = (n + 1)n. \)
\( {\text{So}} \)
\( 2\sum\limits_{i = 1}^n i = (n + 1)n, \)
\( \sum\limits_{i = 1}^n i = \frac{{n(n + 1)}}{2},{\text{for}} n = 5{\text{.}} \)
\( {\text{Claim }}\frac{{n(n + 1)}}{2}{\text{, is correct for all }}n. \)
\(
{\text{Proof by induction}}{\text{.}} \hfill \\
{\text{Base case }}n = 1 \hfill \\ \)
\( \sum\limits_{i = 1}^1 i = 1,{\text{ and }}\frac{{n(n + 1)}}{2} = 1.{\text{ Condition holds}}{\text{.}} \)
\(
{\text{Inductive step}}{\text{.}} \hfill \\
{\text{Assume that }}\sum\limits_{i = 1}^k i = \frac{{k(k + 1)}}{2}{\text{ holds}}{\text{.}} \hfill \\
\)
\(
{\text{Then need to prove }}\sum\limits_{i = 1}^{k + 1} i = \frac{{(k + 1)(k + 2)}}{2} \hfill \\
\)
\(
\sum\limits_{i = 1}^{k + 1} i = \sum\limits_{i = 1}^k i + (k + 1) \hfill \\
{\text{ }} = \frac{{k(k + 1)}}{2} + (k + 1) \hfill \\ \)
\(
{\text{ }} = \frac{{k(k + 1)}}{2} + \frac{{2(k + 1)}}{2} \hfill \\
{\text{ }} = \frac{{k(k + 1) + 2(k + 1)}}{2} = \frac{{(k + 1)(k + 2)}}{2} \hfill \\
\)
\( {\text{so }}\sum\limits_{i = 1}^n i = \frac{{n(n + 1)}}{2}{\text{ holds for all }}n. \)
But you knew that already, so why be unnecessarily pedantique?
\( {\text{Need to show that }}\sum\limits_{i = 1}^n i = \frac{{n(n + 1)}}{2}. \)
\( {\text{Let }}n{\text{ be some small value, say 5}}{\text{.}} \)
\(
{\text{Then}} \hfill \\
\)
\(
2\sum\limits_{i = 1}^n i = 2\sum\limits_{i = 1}^5 i = \sum\limits_{i = 1}^5 {2i} = 2 + 4 + 6 + 8 + 10 \)\( = (n - 3) + (n - 1) + (n + 1) + (n + 3) + 2n = 6n \hfill \\
\)
\( {\text{We already said }}6 = (n + 1){\text{, in the expansion so}} \)
\( 6n = (n + 1)n. \)
\( {\text{So}} \)
\( 2\sum\limits_{i = 1}^n i = (n + 1)n, \)
\( \sum\limits_{i = 1}^n i = \frac{{n(n + 1)}}{2},{\text{for}} n = 5{\text{.}} \)
\( {\text{Claim }}\frac{{n(n + 1)}}{2}{\text{, is correct for all }}n. \)
\(
{\text{Proof by induction}}{\text{.}} \hfill \\
{\text{Base case }}n = 1 \hfill \\ \)
\( \sum\limits_{i = 1}^1 i = 1,{\text{ and }}\frac{{n(n + 1)}}{2} = 1.{\text{ Condition holds}}{\text{.}} \)
\(
{\text{Inductive step}}{\text{.}} \hfill \\
{\text{Assume that }}\sum\limits_{i = 1}^k i = \frac{{k(k + 1)}}{2}{\text{ holds}}{\text{.}} \hfill \\
\)
\(
{\text{Then need to prove }}\sum\limits_{i = 1}^{k + 1} i = \frac{{(k + 1)(k + 2)}}{2} \hfill \\
\)
\(
\sum\limits_{i = 1}^{k + 1} i = \sum\limits_{i = 1}^k i + (k + 1) \hfill \\
{\text{ }} = \frac{{k(k + 1)}}{2} + (k + 1) \hfill \\ \)
\(
{\text{ }} = \frac{{k(k + 1)}}{2} + \frac{{2(k + 1)}}{2} \hfill \\
{\text{ }} = \frac{{k(k + 1) + 2(k + 1)}}{2} = \frac{{(k + 1)(k + 2)}}{2} \hfill \\
\)
\( {\text{so }}\sum\limits_{i = 1}^n i = \frac{{n(n + 1)}}{2}{\text{ holds for all }}n. \)
But you knew that already, so why be unnecessarily pedantique?
Last edited: