Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

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

Atoning (I hope) for my silly previous question, are there infinitely many equalities of the form $\binom{n}{k}=\binom{n'}{k'}$ with $k,k' \geq 2$, $n \geq 2k$, $n' \geq 2k'$ and $n \neq n'$?

EDIT: According to the Wikipedia article on Singmaster's Conjecture, yes there are: there are infinitely many solutions to $\binom{n}{k+2}=\binom{n+1}{k+1}$.

Sorry for the spam.

share|cite|improve this question
Perhaps you can answer the question yourself so that it does not remain unanswered. I think I first saw the conjecture here:… – Eric Naslund Nov 25 '11 at 11:13
The link to the article about Singmaster's conjecture is probably as good an answer to this question as anybody knows. – Michael Hardy Nov 25 '11 at 16:10
up vote 2 down vote accepted

So as not to leave the question unanswered: Yes, there are infinitely many such coincidences. An infinite family is given by

$\binom{n}{k+2} = \binom{n+1}{k+1}$

with $n = F_{2i+2}F_{2i+3}-1$, $k = F_{2i}F_{2i+3}-1$ and $F_n$ is the Fibonacci sequence indexed such that $F_1=F_2=1$.

share|cite|improve this answer

Your Answer


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.