Proofs involving Catalan Numbers

  • Thread starter Thread starter saubbie
  • Start date Start date
  • Tags Tags
    Numbers Proofs
saubbie
Messages
8
Reaction score
0

Homework Statement



I need to prove two things about the Catalan numbers. The first is that Cn is odd iff n=(2^k)-1 for some positive integer k.

The second is that given the matrix A defined by the rule a(i,j)=C(i+j), prove that det A=1. I have not covered determinants in my linear class yet, so I do not have any idea what to do with this one.

Homework Equations





The Attempt at a Solution



I am assuming that both proceed by induction. The first one seems to be more direct, but I am really lost as to how to proceed with both. Any help or suggestions is greatly appreciated. Thanks a lot!
 
Physics news on Phys.org
I would start by writing down the definition of Catalan numbers!
 
Sorry. The Catalan numbers are 1,1,2,5,14,42,... given by the formula Cn=(1/(n+1))*2n choose n. With 2n choose n equal to (2n)!/(n!n!). Sorry for the bad form, I don't have any math writing program.
 
That's
\frac{1}{n+1}\frac{(2n)!}{n!n!}
Click on that to see the code. You don't need a "math writing program" on your own computer.
 
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