In Part 1
It shows that
Step 1 is Show it is true for n=1
Step 2 is Show that if n=k is true then n=k+1 is also true
so How to Do it?
Step 1 : * prove* it is true for n=1 (normally)
Step 2 : done in this way normally we can prove it out..
First ~ Assume it is true forn=k
Second ~ Prove it is true for n=k+1 (normally we can use the n=k case as fact )
S (n / k) must be all positive integers including n/k
EXAMPLE
PROVE 1 + 3 + 5 + ... + (2n-1) = n^2
Fisrt : Show it is true for n=1
from LEFT : 1+3+5+.....+(2(1)-1) = 1
from RIGHT n^2 = (1^2) =1 SO 1 = 1^2 is True
SECOND : Assume it is true for n=k
1 + 3 + 5 + ... + (2^k-1) = k^2 is True
(prove it by yourself :) write down your steps in comment )
THIRD : prove it is true for k+1
1 + 3 + 5 + ... + (2^k-1) + (2^(k+1)-1) = (k+1)^2 ... ? (prove it by yourself :) write down your steps in comment )
We know that 1 + 3 + 5 + ... + (2k-1) = k^2 (the assumption above), so we can do a replacement for all but the last term:
k^2 + (2(k+1)-1) = (k+1)^2
THEN expanding all terms:
LEFT : k^2 + 2k + 2 - 1 = k^2 + 2k+1
NEXT simplifying :
RIGHT :k^2 + 2k + 1 = k^2 + 2k + 1
LEFT and RIGHT are the same! So it is true, it is proven.
THEREFORE :
1 + 3 + 5 + ... + (2(k+1)-1) = (k+1)^2 is TRUE!!!!!!
Mathematical Induction IS done !!! :)
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
calculus?
so it is math
really?
what
roar
feeling lucky
feeling happy
feeling sad
tiger
is that true?
yes
no
Log in to reply
What have you been telling?
what is your question ? I can't understand what did you want to say through your comments..
a
good
nice