Are there surprisingly identical binomial coefficients? The 2019 Stack Overflow Developer...
Why does the nucleus not repel itself?
What do these terms in Caesar's Gallic Wars mean?
If I score a critical hit on an 18 or higher, what are my chances of getting a critical hit if I roll 3d20?
Will it cause any balance problems to have PCs level up and gain the benefits of a long rest mid-fight?
Loose spokes after only a few rides
Is it safe to harvest rainwater that fell on solar panels?
How did passengers keep warm on sail ships?
Deal with toxic manager when you can't quit
Did any laptop computers have a built-in 5 1/4 inch floppy drive?
How do PCB vias affect signal quality?
"as much details as you can remember"
How can I add encounters in the Lost Mine of Phandelver campaign without giving PCs too much XP?
A word that means fill it to the required quantity
Why don't hard Brexiteers insist on a hard border to prevent illegal immigration after Brexit?
Can you cast a spell on someone in the Ethereal Plane, if you are on the Material Plane and have the True Seeing spell active?
What could be the right powersource for 15 seconds lifespan disposable giant chainsaw?
Short story: child made less intelligent and less attractive
Why not take a picture of a closer black hole?
The phrase "to the numbers born"?
I am an eight letter word. What am I?
For what reasons would an animal species NOT cross a *horizontal* land bridge?
Is Cinnamon a desktop environment or a window manager? (Or both?)
What to do when moving next to a bird sanctuary with a loosely-domesticated cat?
What does もの mean in this sentence?
Are there surprisingly identical binomial coefficients?
The 2019 Stack Overflow Developer Survey Results Are InHow to reverse the $n$ choose $k$ formula?How often can a number occur in Pascals Triangle?Are there infinitely many binomial coincidences?Are there infinitely many binomial coincidences?Question about new proof in number theory?Zhang's theorem and Polignac's conjectureIs there only a finite amount of primes that differ by $2k in mathbb N$?Are there prime gaps of every size?Are there infinitely many pairs of primes, $p$ and $q$, such that $q = 4p + 1$?Expressing Factorials with Binomial CoefficientsFor every prime $p$, are there infinitely many integers $k$, such that $p$, $p+k$, and $kp+1$ are all primes?Are there infinitely many primes $n$ such that $mathbb{Z}_n^*$ is generated by ${ -1,2 }$?When do different binomial coefficients coincide?
$begingroup$
Suppose $binom{n}{k}=binom{n'}{k'}$ with $k geq 2$, $k' geq 2$, $n geq 2k$ and $n' geq 2k'$. Does it follow that $n=n'$ and $k=k'$?
EDIT: Yup, $binom{16}{2}=binom{10}{3}=120$.
Now I want to ask if there are infinitely many such pairs, but I should probably ask that in a separate question. Thanks!
EDIT 2: for future reference, yes there are infinitely many such coincidences. See Singmaster's Conjecture.
number-theory binomial-coefficients
$endgroup$
add a comment |
$begingroup$
Suppose $binom{n}{k}=binom{n'}{k'}$ with $k geq 2$, $k' geq 2$, $n geq 2k$ and $n' geq 2k'$. Does it follow that $n=n'$ and $k=k'$?
EDIT: Yup, $binom{16}{2}=binom{10}{3}=120$.
Now I want to ask if there are infinitely many such pairs, but I should probably ask that in a separate question. Thanks!
EDIT 2: for future reference, yes there are infinitely many such coincidences. See Singmaster's Conjecture.
number-theory binomial-coefficients
$endgroup$
$begingroup$
Rephrased: "Are there numbers in Pascal's triangle that are equal, apart from the obvious right-left symmetry?" I haven't checked, but I am convinced that there are quite a few.
$endgroup$
– Arthur
Nov 25 '11 at 7:01
3
$begingroup$
A related question on MO: mathoverflow.net/questions/17058/factorials-in-pascals-triangle
$endgroup$
– KCd
Nov 25 '11 at 7:29
add a comment |
$begingroup$
Suppose $binom{n}{k}=binom{n'}{k'}$ with $k geq 2$, $k' geq 2$, $n geq 2k$ and $n' geq 2k'$. Does it follow that $n=n'$ and $k=k'$?
EDIT: Yup, $binom{16}{2}=binom{10}{3}=120$.
Now I want to ask if there are infinitely many such pairs, but I should probably ask that in a separate question. Thanks!
EDIT 2: for future reference, yes there are infinitely many such coincidences. See Singmaster's Conjecture.
number-theory binomial-coefficients
$endgroup$
Suppose $binom{n}{k}=binom{n'}{k'}$ with $k geq 2$, $k' geq 2$, $n geq 2k$ and $n' geq 2k'$. Does it follow that $n=n'$ and $k=k'$?
EDIT: Yup, $binom{16}{2}=binom{10}{3}=120$.
Now I want to ask if there are infinitely many such pairs, but I should probably ask that in a separate question. Thanks!
EDIT 2: for future reference, yes there are infinitely many such coincidences. See Singmaster's Conjecture.
number-theory binomial-coefficients
number-theory binomial-coefficients
edited Nov 25 '11 at 7:17
Alon Amit
asked Nov 25 '11 at 6:43
Alon AmitAlon Amit
10.7k3768
10.7k3768
$begingroup$
Rephrased: "Are there numbers in Pascal's triangle that are equal, apart from the obvious right-left symmetry?" I haven't checked, but I am convinced that there are quite a few.
$endgroup$
– Arthur
Nov 25 '11 at 7:01
3
$begingroup$
A related question on MO: mathoverflow.net/questions/17058/factorials-in-pascals-triangle
$endgroup$
– KCd
Nov 25 '11 at 7:29
add a comment |
$begingroup$
Rephrased: "Are there numbers in Pascal's triangle that are equal, apart from the obvious right-left symmetry?" I haven't checked, but I am convinced that there are quite a few.
$endgroup$
– Arthur
Nov 25 '11 at 7:01
3
$begingroup$
A related question on MO: mathoverflow.net/questions/17058/factorials-in-pascals-triangle
$endgroup$
– KCd
Nov 25 '11 at 7:29
$begingroup$
Rephrased: "Are there numbers in Pascal's triangle that are equal, apart from the obvious right-left symmetry?" I haven't checked, but I am convinced that there are quite a few.
$endgroup$
– Arthur
Nov 25 '11 at 7:01
$begingroup$
Rephrased: "Are there numbers in Pascal's triangle that are equal, apart from the obvious right-left symmetry?" I haven't checked, but I am convinced that there are quite a few.
$endgroup$
– Arthur
Nov 25 '11 at 7:01
3
3
$begingroup$
A related question on MO: mathoverflow.net/questions/17058/factorials-in-pascals-triangle
$endgroup$
– KCd
Nov 25 '11 at 7:29
$begingroup$
A related question on MO: mathoverflow.net/questions/17058/factorials-in-pascals-triangle
$endgroup$
– KCd
Nov 25 '11 at 7:29
add a comment |
5 Answers
5
active
oldest
votes
$begingroup$
There are one or two (nontrivial) choices of $(m,n)$ where $binom{n}{2} = binom{m}{3}$. Comparing the sequences on OEIS might be faster than coming up with the correct words to find it in a search engine.
Edit: 120 is in both sequences, with $m=10$ and $n=16$. In OEIS the list of triangular numbers ( http://oeis.org/A000217 ) and tetrahedral numbers ( http://oeis.org/A000292 ) shows that there are no other small examples and I am pretty sure that this pair is known to be the largest integer solution of $3y(y-1)=x(x-1)(x-2)$, and that this was first proved in an elementary way that does not use the theory of elliptic curves.
$endgroup$
add a comment |
$begingroup$
$$
binom{3003}{1} = binom{78}{2} = binom{15}{5} = binom{14}{6}.
$$
Nobody knows whether any number besides 3003 appears at least eight times in Pascal's triangle.
$endgroup$
add a comment |
$begingroup$
Let $f(t)$ be the number of ways in which $t$ can be written as a binomial coefficient. Then the question can be restated equivalently as asking whether $f(t) leqslant 2$ for all $t$. As the other answers point out, there are numerous counterexamples to this strong claim.
It is however likely that a weaker form of this statement is true. Singmaster's conjecture states that there exists some $M lt infty$ such that $f(t) leqslant M$ for all $t$. This is still open. The best known upper bound, due to D. Kane, is $$f(t) = O left(frac{(log t) cdot (log log log t) }{(log log t)^3} right) .$$ On the other hand, it is consistent with our current knowledge that $f(t)$ never exceeds $8$.
Reference: This MO post by Michael Hardy asks for recent progress on this problem.
$endgroup$
add a comment |
$begingroup$
10-choose-4 = 21-choose-2.${}{}{}{}$
$endgroup$
$begingroup$
Did you mean to write $binom{10}{4} = binom{21}{2}$ ?
$endgroup$
– Sasha
Nov 25 '11 at 6:59
1
$begingroup$
Trying to guess what you meant, since it obviously isn't $binom{10}{2}=binom{21}{4}$...
$endgroup$
– Alon Amit
Nov 25 '11 at 7:01
$begingroup$
${10choose 4} = {21 choose 2}$
$endgroup$
– Chris Taylor
Nov 25 '11 at 7:02
1
$begingroup$
Oops. Miscopied from my source. Thanks for spotting the error and figuring out what I meant.
$endgroup$
– Gerry Myerson
Nov 25 '11 at 10:13
$begingroup$
@Gerry I took the liberty to correct the typo. Hope it's ok. Regards,
$endgroup$
– Srivatsan
Nov 25 '11 at 13:42
add a comment |
$begingroup$
$$binom{10}{3}=binom{16}{2}.$$
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f85442%2fare-there-surprisingly-identical-binomial-coefficients%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
5 Answers
5
active
oldest
votes
5 Answers
5
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
There are one or two (nontrivial) choices of $(m,n)$ where $binom{n}{2} = binom{m}{3}$. Comparing the sequences on OEIS might be faster than coming up with the correct words to find it in a search engine.
Edit: 120 is in both sequences, with $m=10$ and $n=16$. In OEIS the list of triangular numbers ( http://oeis.org/A000217 ) and tetrahedral numbers ( http://oeis.org/A000292 ) shows that there are no other small examples and I am pretty sure that this pair is known to be the largest integer solution of $3y(y-1)=x(x-1)(x-2)$, and that this was first proved in an elementary way that does not use the theory of elliptic curves.
$endgroup$
add a comment |
$begingroup$
There are one or two (nontrivial) choices of $(m,n)$ where $binom{n}{2} = binom{m}{3}$. Comparing the sequences on OEIS might be faster than coming up with the correct words to find it in a search engine.
Edit: 120 is in both sequences, with $m=10$ and $n=16$. In OEIS the list of triangular numbers ( http://oeis.org/A000217 ) and tetrahedral numbers ( http://oeis.org/A000292 ) shows that there are no other small examples and I am pretty sure that this pair is known to be the largest integer solution of $3y(y-1)=x(x-1)(x-2)$, and that this was first proved in an elementary way that does not use the theory of elliptic curves.
$endgroup$
add a comment |
$begingroup$
There are one or two (nontrivial) choices of $(m,n)$ where $binom{n}{2} = binom{m}{3}$. Comparing the sequences on OEIS might be faster than coming up with the correct words to find it in a search engine.
Edit: 120 is in both sequences, with $m=10$ and $n=16$. In OEIS the list of triangular numbers ( http://oeis.org/A000217 ) and tetrahedral numbers ( http://oeis.org/A000292 ) shows that there are no other small examples and I am pretty sure that this pair is known to be the largest integer solution of $3y(y-1)=x(x-1)(x-2)$, and that this was first proved in an elementary way that does not use the theory of elliptic curves.
$endgroup$
There are one or two (nontrivial) choices of $(m,n)$ where $binom{n}{2} = binom{m}{3}$. Comparing the sequences on OEIS might be faster than coming up with the correct words to find it in a search engine.
Edit: 120 is in both sequences, with $m=10$ and $n=16$. In OEIS the list of triangular numbers ( http://oeis.org/A000217 ) and tetrahedral numbers ( http://oeis.org/A000292 ) shows that there are no other small examples and I am pretty sure that this pair is known to be the largest integer solution of $3y(y-1)=x(x-1)(x-2)$, and that this was first proved in an elementary way that does not use the theory of elliptic curves.
edited Nov 25 '11 at 7:06
answered Nov 25 '11 at 6:51
zyxzyx
31.7k33699
31.7k33699
add a comment |
add a comment |
$begingroup$
$$
binom{3003}{1} = binom{78}{2} = binom{15}{5} = binom{14}{6}.
$$
Nobody knows whether any number besides 3003 appears at least eight times in Pascal's triangle.
$endgroup$
add a comment |
$begingroup$
$$
binom{3003}{1} = binom{78}{2} = binom{15}{5} = binom{14}{6}.
$$
Nobody knows whether any number besides 3003 appears at least eight times in Pascal's triangle.
$endgroup$
add a comment |
$begingroup$
$$
binom{3003}{1} = binom{78}{2} = binom{15}{5} = binom{14}{6}.
$$
Nobody knows whether any number besides 3003 appears at least eight times in Pascal's triangle.
$endgroup$
$$
binom{3003}{1} = binom{78}{2} = binom{15}{5} = binom{14}{6}.
$$
Nobody knows whether any number besides 3003 appears at least eight times in Pascal's triangle.
answered Nov 25 '11 at 16:08
Michael HardyMichael Hardy
1
1
add a comment |
add a comment |
$begingroup$
Let $f(t)$ be the number of ways in which $t$ can be written as a binomial coefficient. Then the question can be restated equivalently as asking whether $f(t) leqslant 2$ for all $t$. As the other answers point out, there are numerous counterexamples to this strong claim.
It is however likely that a weaker form of this statement is true. Singmaster's conjecture states that there exists some $M lt infty$ such that $f(t) leqslant M$ for all $t$. This is still open. The best known upper bound, due to D. Kane, is $$f(t) = O left(frac{(log t) cdot (log log log t) }{(log log t)^3} right) .$$ On the other hand, it is consistent with our current knowledge that $f(t)$ never exceeds $8$.
Reference: This MO post by Michael Hardy asks for recent progress on this problem.
$endgroup$
add a comment |
$begingroup$
Let $f(t)$ be the number of ways in which $t$ can be written as a binomial coefficient. Then the question can be restated equivalently as asking whether $f(t) leqslant 2$ for all $t$. As the other answers point out, there are numerous counterexamples to this strong claim.
It is however likely that a weaker form of this statement is true. Singmaster's conjecture states that there exists some $M lt infty$ such that $f(t) leqslant M$ for all $t$. This is still open. The best known upper bound, due to D. Kane, is $$f(t) = O left(frac{(log t) cdot (log log log t) }{(log log t)^3} right) .$$ On the other hand, it is consistent with our current knowledge that $f(t)$ never exceeds $8$.
Reference: This MO post by Michael Hardy asks for recent progress on this problem.
$endgroup$
add a comment |
$begingroup$
Let $f(t)$ be the number of ways in which $t$ can be written as a binomial coefficient. Then the question can be restated equivalently as asking whether $f(t) leqslant 2$ for all $t$. As the other answers point out, there are numerous counterexamples to this strong claim.
It is however likely that a weaker form of this statement is true. Singmaster's conjecture states that there exists some $M lt infty$ such that $f(t) leqslant M$ for all $t$. This is still open. The best known upper bound, due to D. Kane, is $$f(t) = O left(frac{(log t) cdot (log log log t) }{(log log t)^3} right) .$$ On the other hand, it is consistent with our current knowledge that $f(t)$ never exceeds $8$.
Reference: This MO post by Michael Hardy asks for recent progress on this problem.
$endgroup$
Let $f(t)$ be the number of ways in which $t$ can be written as a binomial coefficient. Then the question can be restated equivalently as asking whether $f(t) leqslant 2$ for all $t$. As the other answers point out, there are numerous counterexamples to this strong claim.
It is however likely that a weaker form of this statement is true. Singmaster's conjecture states that there exists some $M lt infty$ such that $f(t) leqslant M$ for all $t$. This is still open. The best known upper bound, due to D. Kane, is $$f(t) = O left(frac{(log t) cdot (log log log t) }{(log log t)^3} right) .$$ On the other hand, it is consistent with our current knowledge that $f(t)$ never exceeds $8$.
Reference: This MO post by Michael Hardy asks for recent progress on this problem.
edited Apr 13 '17 at 12:58
Community♦
1
1
answered Nov 25 '11 at 6:58
SrivatsanSrivatsan
21.1k371126
21.1k371126
add a comment |
add a comment |
$begingroup$
10-choose-4 = 21-choose-2.${}{}{}{}$
$endgroup$
$begingroup$
Did you mean to write $binom{10}{4} = binom{21}{2}$ ?
$endgroup$
– Sasha
Nov 25 '11 at 6:59
1
$begingroup$
Trying to guess what you meant, since it obviously isn't $binom{10}{2}=binom{21}{4}$...
$endgroup$
– Alon Amit
Nov 25 '11 at 7:01
$begingroup$
${10choose 4} = {21 choose 2}$
$endgroup$
– Chris Taylor
Nov 25 '11 at 7:02
1
$begingroup$
Oops. Miscopied from my source. Thanks for spotting the error and figuring out what I meant.
$endgroup$
– Gerry Myerson
Nov 25 '11 at 10:13
$begingroup$
@Gerry I took the liberty to correct the typo. Hope it's ok. Regards,
$endgroup$
– Srivatsan
Nov 25 '11 at 13:42
add a comment |
$begingroup$
10-choose-4 = 21-choose-2.${}{}{}{}$
$endgroup$
$begingroup$
Did you mean to write $binom{10}{4} = binom{21}{2}$ ?
$endgroup$
– Sasha
Nov 25 '11 at 6:59
1
$begingroup$
Trying to guess what you meant, since it obviously isn't $binom{10}{2}=binom{21}{4}$...
$endgroup$
– Alon Amit
Nov 25 '11 at 7:01
$begingroup$
${10choose 4} = {21 choose 2}$
$endgroup$
– Chris Taylor
Nov 25 '11 at 7:02
1
$begingroup$
Oops. Miscopied from my source. Thanks for spotting the error and figuring out what I meant.
$endgroup$
– Gerry Myerson
Nov 25 '11 at 10:13
$begingroup$
@Gerry I took the liberty to correct the typo. Hope it's ok. Regards,
$endgroup$
– Srivatsan
Nov 25 '11 at 13:42
add a comment |
$begingroup$
10-choose-4 = 21-choose-2.${}{}{}{}$
$endgroup$
10-choose-4 = 21-choose-2.${}{}{}{}$
edited Mar 21 at 21:01
answered Nov 25 '11 at 6:52
Gerry MyersonGerry Myerson
148k8152306
148k8152306
$begingroup$
Did you mean to write $binom{10}{4} = binom{21}{2}$ ?
$endgroup$
– Sasha
Nov 25 '11 at 6:59
1
$begingroup$
Trying to guess what you meant, since it obviously isn't $binom{10}{2}=binom{21}{4}$...
$endgroup$
– Alon Amit
Nov 25 '11 at 7:01
$begingroup$
${10choose 4} = {21 choose 2}$
$endgroup$
– Chris Taylor
Nov 25 '11 at 7:02
1
$begingroup$
Oops. Miscopied from my source. Thanks for spotting the error and figuring out what I meant.
$endgroup$
– Gerry Myerson
Nov 25 '11 at 10:13
$begingroup$
@Gerry I took the liberty to correct the typo. Hope it's ok. Regards,
$endgroup$
– Srivatsan
Nov 25 '11 at 13:42
add a comment |
$begingroup$
Did you mean to write $binom{10}{4} = binom{21}{2}$ ?
$endgroup$
– Sasha
Nov 25 '11 at 6:59
1
$begingroup$
Trying to guess what you meant, since it obviously isn't $binom{10}{2}=binom{21}{4}$...
$endgroup$
– Alon Amit
Nov 25 '11 at 7:01
$begingroup$
${10choose 4} = {21 choose 2}$
$endgroup$
– Chris Taylor
Nov 25 '11 at 7:02
1
$begingroup$
Oops. Miscopied from my source. Thanks for spotting the error and figuring out what I meant.
$endgroup$
– Gerry Myerson
Nov 25 '11 at 10:13
$begingroup$
@Gerry I took the liberty to correct the typo. Hope it's ok. Regards,
$endgroup$
– Srivatsan
Nov 25 '11 at 13:42
$begingroup$
Did you mean to write $binom{10}{4} = binom{21}{2}$ ?
$endgroup$
– Sasha
Nov 25 '11 at 6:59
$begingroup$
Did you mean to write $binom{10}{4} = binom{21}{2}$ ?
$endgroup$
– Sasha
Nov 25 '11 at 6:59
1
1
$begingroup$
Trying to guess what you meant, since it obviously isn't $binom{10}{2}=binom{21}{4}$...
$endgroup$
– Alon Amit
Nov 25 '11 at 7:01
$begingroup$
Trying to guess what you meant, since it obviously isn't $binom{10}{2}=binom{21}{4}$...
$endgroup$
– Alon Amit
Nov 25 '11 at 7:01
$begingroup$
${10choose 4} = {21 choose 2}$
$endgroup$
– Chris Taylor
Nov 25 '11 at 7:02
$begingroup$
${10choose 4} = {21 choose 2}$
$endgroup$
– Chris Taylor
Nov 25 '11 at 7:02
1
1
$begingroup$
Oops. Miscopied from my source. Thanks for spotting the error and figuring out what I meant.
$endgroup$
– Gerry Myerson
Nov 25 '11 at 10:13
$begingroup$
Oops. Miscopied from my source. Thanks for spotting the error and figuring out what I meant.
$endgroup$
– Gerry Myerson
Nov 25 '11 at 10:13
$begingroup$
@Gerry I took the liberty to correct the typo. Hope it's ok. Regards,
$endgroup$
– Srivatsan
Nov 25 '11 at 13:42
$begingroup$
@Gerry I took the liberty to correct the typo. Hope it's ok. Regards,
$endgroup$
– Srivatsan
Nov 25 '11 at 13:42
add a comment |
$begingroup$
$$binom{10}{3}=binom{16}{2}.$$
$endgroup$
add a comment |
$begingroup$
$$binom{10}{3}=binom{16}{2}.$$
$endgroup$
add a comment |
$begingroup$
$$binom{10}{3}=binom{16}{2}.$$
$endgroup$
$$binom{10}{3}=binom{16}{2}.$$
answered Nov 25 '11 at 6:56
André NicolasAndré Nicolas
455k36432821
455k36432821
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f85442%2fare-there-surprisingly-identical-binomial-coefficients%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Rephrased: "Are there numbers in Pascal's triangle that are equal, apart from the obvious right-left symmetry?" I haven't checked, but I am convinced that there are quite a few.
$endgroup$
– Arthur
Nov 25 '11 at 7:01
3
$begingroup$
A related question on MO: mathoverflow.net/questions/17058/factorials-in-pascals-triangle
$endgroup$
– KCd
Nov 25 '11 at 7:29