Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Two Integer Partition Problems

Let $P(n,k,m)$ be the number of partitions of $n$ into $k$ parts with all parts $\leq m$.

So $P(10,3,4) = 2$, i.e., (4,4,2); (4,3,3).

I need help proving the following:

$P(2n,3,n-1) = P(2n-3,3, n-2)$
$P(4n+3, 3, 2n+1) = P(4n,3,2n-1) + n + 1$.

share|cite|improve this question

For the first one: For any partition $2n=a+b+c$ where $a,b,c \leq n-1$, we have a partition $2n-3=(a-1)+(b-1)+(c-1)$ where $a-1,b-1,c-1 \leq n-2$ and vice versa.

share|cite|improve this answer
1  
To do this you also have to show that $c$ (the smallest part of $2n$) is at least $2$, so that $c-1$ is positive. This is not difficult as $c= n- (a+b) \ge n-((n-1)+(n-1))=2$. – Henry Jan 18 '12 at 17:40
    
Thank you @Henry. – HbCwiRoJDp Jan 18 '12 at 17:49

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.