Working through old problems that I haven't done yet and I've been stuck on this one all day now.
Anybody mind telling me what I'm doing wrong?
I don't understand where that [math]\sqrt{n + 1}[/math] is supposed to come from in the end.
Is this the wrong approach?
>>8653657
didn't you simplify something incorrectly in the steps between the >= and the next =? it's a multiplication, not an addition
>>8653674
(2n+1)=2(n+1)-1
>>8653657
Use this statement:
∀P((0∈P∧∀i(i∈P-->i+1∈P)) --> ∀n(n∈P))
you forgot to multiply the. (-1/(n+1)) by everything else, 2 rows b4 the ???
Lol just finished doing induction proofs in discrete math. Some of the algebra was pretty annoying and the way to manipulate things was stuff I've never seen
>>8653703
Examples? Did it involve factorials?
I think I have the answer but I don't know latex, so this will take a while to format. Check back in a bit OP.
>>8653657
The crux of the induction hypothesis is that the original proposition is true.
So assume 2n choose n > = stuff.
Then just show 2n+1 choose n+1 > 2n choose n.
If that's true, then 2n+1 choose n+1 >= stuff.
>>8653913 here, finally done with latex.
Continuing from >>8653657, at the line where you used the induction hypothesis
>>8654050
And this is it
I used blue to indicate cancelling a term, and gold for annotations
I'm not sure if this is correct though
>>8654053
Thanks a bunch for this, anon, looks correct to me.
I can rest easy now.