How to Resolve Errors in Proof by Induction for a Factorial Ratio?

  • Thread starter Thread starter Ryuky
  • Start date Start date
  • Tags Tags
    Induction Proof
Ryuky
Messages
6
Reaction score
0

Homework Statement



So we have to prove that \frac{(n+1)(n+2)(n+3)...(2n)}{1*3*5...*(2n-1)} = 2n2. The attempt at a solution

I. For n=1, obviously the proposition is true. (2*1/(2-1) = 2^1 = 2)

II. Let n=k and assume \frac{(k+1)(k+2)(k+3)...(2k)}{1*3*5...*(2k-1)} = 2k.

Now, for n=k+1 we have: 2k * \frac{(2k +2)}{2k+1)} = 2k+1 → 2(k+1)*\frac{(k+1)}{2k+1)} = 2k+1. Which is not true.

So, I cannot figure out what am I doing wrong.
Thanks in advance...
 
Physics news on Phys.org
You forgot that in the nominator, you're starting at n+1. So, by doing the transition k->k+1, you need to divide by k+1 also to take that into account. Also, you need to multiply by (2k+1)*(2k+2), since in the nominator you have the product over all numbers between k+1 and 2k.
So, what you get is: (2k+1)*(2k+2)/(k+1)/(2k+1)=2
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top