- #1
Bingk
- 22
- 0
Prove that
R(p,q) \leq \left(\stackrel{p+q-2}{p-1}\right)
where p and q are positive integers
I'm supposed to use induction on the inequality R(p,q) \leq R(p-1,q) + R(p,q-1), but I'm having difficulty there.
How do I go about doing this? I can show it's true for p=q=1.
But, I can't see how I get the combination in the first inequality from an induction on the second inequality (which doesn't contain a combination) ...
R(p,q) \leq \left(\stackrel{p+q-2}{p-1}\right)
where p and q are positive integers
I'm supposed to use induction on the inequality R(p,q) \leq R(p-1,q) + R(p,q-1), but I'm having difficulty there.
How do I go about doing this? I can show it's true for p=q=1.
But, I can't see how I get the combination in the first inequality from an induction on the second inequality (which doesn't contain a combination) ...
