#Mathematical Induction
81 messages · Page 1 of 1 (latest)
- Wait patiently for a helper to come along.
- Once someone helps you, say thank you and close the thread with:
+close
- Feel free to nominate the person for helper of the week in #helper-nominations
- Do not ping the mods, unless someone is breaking the rules.
- If you're happy with the help you got here, and the server overall, you can contribute financially as well:
First check if it works for n=1, then show that it works for n=k+1 given the induction hypothesis that it works for n=k
ok so then $\frac{n^2+n}{2}$
xNiden
$\frac{1^2+1}{2}$
xNiden
$\frac{2}{2}$ = 1
xNiden
For $n=1$ we have $1²+1=2$ which is divisible by $2$, hence it follows for $n=1$
fäf kaka
Induction hypothesis: Let $n²+n$ be divisible by $2$ for $n=k$\
Using this we have to probe that $n²+n$ is divisible by $2$ for $n=k+1$
fäf kaka
where did you get m from?
If it's divisible by 2 then there is some quotient
We don't know what m is, we just use it as unknown quotient
Ah ok i see
xNiden
so then $m+1+k+1$?
xNiden
How k?
idk that's what you had
See properly
You are supposed to replace k²+k by 2m
xNiden
oh
what about the 2k?
It remains
xNiden
xNiden

im referring to this

I know
$k^2+2k+1+k+1$ = $k^2+3k+2$
xNiden
m(2k+2)
Then replace k²+k by 2m
oh
How is this a product?
No
wait lemme recheck
if $m = k^2+k$ then we have $k^2+3k+2$ so then this would be 2m(2k+2)
xNiden

how is it not?
fäf kaka
xNiden
since its divisible by 2 then would we divide it by 2?
or would it be left like this?
2(m+k+1)
mm i see
Left like this and then with a statement that it's divisible by 2