TITLE: Find $n$ and $k$ if $\:\binom{n\:}{k-1}=2002\:\:\:\binom{n\:}{k}=3003\:\:$
QUESTION [9 upvotes]: $$ \:\binom{n\:}{k-1}=2002\:\:\:\binom{n\:}{k}=3003\:\: $$
What are the values for n and k?
My initial idea was to divide those two:
$$\frac{\binom{n\:}{k-1}}{\binom{n\:}{k}}=\frac{2002}{3003}\:\:$$
$$\frac{\frac{n!}{\left(k-1\right)!\left(n+1-k\right)!}}{\frac{n!}{k!\left(n-k\right)!}}\:=\frac{2}{3}$$
$$ \frac{k}{n+1-k}\:=\frac{2}{3} $$
After that sum them up:
$$\binom{n\:}{k-1}+\binom{n\:}{k}=\binom{n+1\:}{k}=5005$$
And now devide the third with the first term and solve everything.
However I would get both times $5k = 2n+2$ and that's the problem.

REPLY [4 votes]: I originally drew a large version of Pascal's Triangle after telling my father that the total number of gifts in The Twelve Days of Christmas song was $$ \:\binom{14\:}{3} = 364$$ and he complained, "What's wrong with $12?$" I tried to explain how the cumulative sums along the diagonals introduce a bit of an offset, The number of new gifts on day $n$ is $ \:\binom{n\:}{1},$ the total gifts on day $n$ is $ \:\binom{n + 1\:}{2},$ the total gifts on all days up to and including day $n$ is $ \:\binom{n + 2\:}{3}.$ He didn't like it. Later, I found a piece of paper where he had carefully written out the sums in $\Sigma$ notation, and got it right, of course.
Back to this problem, I have always liked that consecutive entries in row $14$ give $1001,2002,3003.$ I wonder whether that ever happens again, $A,2A,3A?$ Maybe not: this seems to give a complete answer: Find three consecutive entries of a row of Pascal triangle that are in the ratio of 1 : 2 : 3