Mixing
number of different ways to represent a positive integer as a binomial coefficient
Clash Royale CLAN TAG#URR8PPP
up vote
7
down vote
favorite
For each positive integer $x$, let $f(x)$ be the number of different ways that $x$ can be expressed in the form $x=largebinomnk$, where $n,k$ are integers with $2 le k le largefracn2$.
For each positive integer $m$, let $X_m = xmid f(x) ge m$.
A restated version of a recent question
IS IT POSSIBLE TO REPRESENT EVERY POSITIVE INTEGER AS NcR(N CHOOSE R) OTHER THAN THE TRIVIAL FORM "N choose N-1""
asks whether every integer greater than $1$ is in $X_1$.
The OP provided no context, so predictably, the question was put on hold, and most likely, the question will soon be closed, and eventually deleted.
It's easily shown that for fixed $n$, the values of the binomial coefficients $largebinomnk$ are strictly increasing for $2 le k le largefracn2$.
It then follows easily that the least element of $X_1$ is $largebinom42=6$, which resolves the OP's question with an answer of "no".
In the comments to the linked question, JMoravitz provides an argument (which could have been an answer), showing that no primes are in $X_1$.
A quick program to get the initial elements of $X_1$ yields the values
$$6, 10, 15, 20, 21, 28, 35, 36, 45, 55, 56, 66, 70, 78, 84, 91$$
which matches the OEIS sequence
https://oeis.org/A006987
But some questions arise . . .
Question $(1)$:$;$Is $X_2$ infinite?
I can answer this one, but not the others, at least not yet.
For question $(1)$, the answer is "yes".
Claim:
If $n,k$ are integers with $2 le k le largefracn2$, the equation
$$binomnk=binomn+1k-1$$
holds if and only if $5n^2+12n+8$ is a perfect square and
$$k=frac3n+4-sqrt5n^2+12n+82$$
Proof:
The equation
$$binomnk=binomn+1k-1$$
reduces to the quadratic equation
$$k^2-(3n+4)k+(n^2+3n+2)=0$$
hence, the quadratic formula (together with constraint $2 le k le largefracn2$) clinches the claim.
But the diophantine equation $5n^2+12n+8 = h^2$ is a Pell-type equation with infinitely many solutions in positive integers $n,h$, hence the answer to question $(1)$ is "yes".
What about the elements of $X_2$ other than those determined as described above?
More precisely, let $W_2$ be the set of integers $x$ which can be expressed in the form $largebinomnk$, where $n$ is a positive integer such that $5n^2+12n+8$ is a perfect square, and
$$k=frac3n+4-sqrt5n^2+12n+82$$
Question $(2)$:$;$Is $X_2setminusW_2$ infinite?
Some data . . .
Here are the $5$ smallest elements of $W_2$:
beginalign*
smallbullet;&smallbinom146=smallbinom155\[4pt]
smallbullet;&smallbinom10340=smallbinom10439\[4pt]
smallbullet;&smallbinom713273=smallbinom714272\[4pt]
smallbullet;&smallbinom48941870=smallbinom48951869\[4pt]
smallbullet;&smallbinom3355112816=smallbinom3355212815\[4pt]
endalign*
Here are the elements of $X_2setminusW_2$ that I've found so far:
beginalign*
smallbullet;&smallbinom162=smallbinom103\[4pt]
smallbullet;&smallbinom212=smallbinom104\[4pt]
smallbullet;&smallbinom562=smallbinom223\[4pt]
smallbullet;&smallbinom1202=smallbinom363\[4pt]
smallbullet;&smallbinom1532=smallbinom195\[4pt]
smallbullet;&smallbinom2212=smallbinom178\[4pt]
endalign*
I don't know if there are any others.
Finally, what about $X_3$?
Note that $X_3$ has at least one element, since
$$smallbinom146=smallbinom155=smallbinom782$$
Question $(3)$:$;$Is $X_3$ infinite?
elementary-number-theory diophantine-equations
asked Jul 20 at 2:01
quasi
33.3k22359
add a comment |Â
up vote
7
down vote
favorite
For each positive integer $x$, let $f(x)$ be the number of different ways that $x$ can be expressed in the form $x=largebinomnk$, where $n,k$ are integers with $2 le k le largefracn2$.
For each positive integer $m$, let $X_m = xmid f(x) ge m$.
A restated version of a recent question
IS IT POSSIBLE TO REPRESENT EVERY POSITIVE INTEGER AS NcR(N CHOOSE R) OTHER THAN THE TRIVIAL FORM "N choose N-1""
asks whether every integer greater than $1$ is in $X_1$.
The OP provided no context, so predictably, the question was put on hold, and most likely, the question will soon be closed, and eventually deleted.
It's easily shown that for fixed $n$, the values of the binomial coefficients $largebinomnk$ are strictly increasing for $2 le k le largefracn2$.
It then follows easily that the least element of $X_1$ is $largebinom42=6$, which resolves the OP's question with an answer of "no".
In the comments to the linked question, JMoravitz provides an argument (which could have been an answer), showing that no primes are in $X_1$.
A quick program to get the initial elements of $X_1$ yields the values
$$6, 10, 15, 20, 21, 28, 35, 36, 45, 55, 56, 66, 70, 78, 84, 91$$
which matches the OEIS sequence
https://oeis.org/A006987
But some questions arise . . .
Question $(1)$:$;$Is $X_2$ infinite?
I can answer this one, but not the others, at least not yet.
For question $(1)$, the answer is "yes".
Claim:
If $n,k$ are integers with $2 le k le largefracn2$, the equation
$$binomnk=binomn+1k-1$$
holds if and only if $5n^2+12n+8$ is a perfect square and
$$k=frac3n+4-sqrt5n^2+12n+82$$
Proof:
The equation
$$binomnk=binomn+1k-1$$
reduces to the quadratic equation
$$k^2-(3n+4)k+(n^2+3n+2)=0$$
hence, the quadratic formula (together with constraint $2 le k le largefracn2$) clinches the claim.
But the diophantine equation $5n^2+12n+8 = h^2$ is a Pell-type equation with infinitely many solutions in positive integers $n,h$, hence the answer to question $(1)$ is "yes".
What about the elements of $X_2$ other than those determined as described above?
More precisely, let $W_2$ be the set of integers $x$ which can be expressed in the form $largebinomnk$, where $n$ is a positive integer such that $5n^2+12n+8$ is a perfect square, and
$$k=frac3n+4-sqrt5n^2+12n+82$$
Question $(2)$:$;$Is $X_2setminusW_2$ infinite?
Some data . . .
Here are the $5$ smallest elements of $W_2$:
beginalign*
smallbullet;&smallbinom146=smallbinom155\[4pt]
smallbullet;&smallbinom10340=smallbinom10439\[4pt]
smallbullet;&smallbinom713273=smallbinom714272\[4pt]
smallbullet;&smallbinom48941870=smallbinom48951869\[4pt]
smallbullet;&smallbinom3355112816=smallbinom3355212815\[4pt]
endalign*
Here are the elements of $X_2setminusW_2$ that I've found so far:
beginalign*
smallbullet;&smallbinom162=smallbinom103\[4pt]
smallbullet;&smallbinom212=smallbinom104\[4pt]
smallbullet;&smallbinom562=smallbinom223\[4pt]
smallbullet;&smallbinom1202=smallbinom363\[4pt]
smallbullet;&smallbinom1532=smallbinom195\[4pt]
smallbullet;&smallbinom2212=smallbinom178\[4pt]
endalign*
I don't know if there are any others.
Finally, what about $X_3$?
Note that $X_3$ has at least one element, since
$$smallbinom146=smallbinom155=smallbinom782$$
Question $(3)$:$;$Is $X_3$ infinite?
elementary-number-theory diophantine-equations
asked Jul 20 at 2:01
quasi
33.3k22359
add a comment |Â
up vote
7
down vote
favorite
up vote
7
down vote
favorite
For each positive integer $x$, let $f(x)$ be the number of different ways that $x$ can be expressed in the form $x=largebinomnk$, where $n,k$ are integers with $2 le k le largefracn2$.
For each positive integer $m$, let $X_m = xmid f(x) ge m$.
A restated version of a recent question
IS IT POSSIBLE TO REPRESENT EVERY POSITIVE INTEGER AS NcR(N CHOOSE R) OTHER THAN THE TRIVIAL FORM "N choose N-1""
asks whether every integer greater than $1$ is in $X_1$.
The OP provided no context, so predictably, the question was put on hold, and most likely, the question will soon be closed, and eventually deleted.
It's easily shown that for fixed $n$, the values of the binomial coefficients $largebinomnk$ are strictly increasing for $2 le k le largefracn2$.
It then follows easily that the least element of $X_1$ is $largebinom42=6$, which resolves the OP's question with an answer of "no".
In the comments to the linked question, JMoravitz provides an argument (which could have been an answer), showing that no primes are in $X_1$.
A quick program to get the initial elements of $X_1$ yields the values
$$6, 10, 15, 20, 21, 28, 35, 36, 45, 55, 56, 66, 70, 78, 84, 91$$
which matches the OEIS sequence
https://oeis.org/A006987
But some questions arise . . .
Question $(1)$:$;$Is $X_2$ infinite?
I can answer this one, but not the others, at least not yet.
For question $(1)$, the answer is "yes".
Claim:
If $n,k$ are integers with $2 le k le largefracn2$, the equation
$$binomnk=binomn+1k-1$$
holds if and only if $5n^2+12n+8$ is a perfect square and
$$k=frac3n+4-sqrt5n^2+12n+82$$
Proof:
The equation
$$binomnk=binomn+1k-1$$
reduces to the quadratic equation
$$k^2-(3n+4)k+(n^2+3n+2)=0$$
hence, the quadratic formula (together with constraint $2 le k le largefracn2$) clinches the claim.
But the diophantine equation $5n^2+12n+8 = h^2$ is a Pell-type equation with infinitely many solutions in positive integers $n,h$, hence the answer to question $(1)$ is "yes".
What about the elements of $X_2$ other than those determined as described above?
More precisely, let $W_2$ be the set of integers $x$ which can be expressed in the form $largebinomnk$, where $n$ is a positive integer such that $5n^2+12n+8$ is a perfect square, and
$$k=frac3n+4-sqrt5n^2+12n+82$$
Question $(2)$:$;$Is $X_2setminusW_2$ infinite?
Some data . . .
Here are the $5$ smallest elements of $W_2$:
beginalign*
smallbullet;&smallbinom146=smallbinom155\[4pt]
smallbullet;&smallbinom10340=smallbinom10439\[4pt]
smallbullet;&smallbinom713273=smallbinom714272\[4pt]
smallbullet;&smallbinom48941870=smallbinom48951869\[4pt]
smallbullet;&smallbinom3355112816=smallbinom3355212815\[4pt]
endalign*
Here are the elements of $X_2setminusW_2$ that I've found so far:
beginalign*
smallbullet;&smallbinom162=smallbinom103\[4pt]
smallbullet;&smallbinom212=smallbinom104\[4pt]
smallbullet;&smallbinom562=smallbinom223\[4pt]
smallbullet;&smallbinom1202=smallbinom363\[4pt]
smallbullet;&smallbinom1532=smallbinom195\[4pt]
smallbullet;&smallbinom2212=smallbinom178\[4pt]
endalign*
I don't know if there are any others.
Finally, what about $X_3$?
Note that $X_3$ has at least one element, since
$$smallbinom146=smallbinom155=smallbinom782$$
Question $(3)$:$;$Is $X_3$ infinite?
elementary-number-theory diophantine-equations
asked Jul 20 at 2:01
quasi
33.3k22359
For each positive integer $x$, let $f(x)$ be the number of different ways that $x$ can be expressed in the form $x=largebinomnk$, where $n,k$ are integers with $2 le k le largefracn2$.
For each positive integer $m$, let $X_m = xmid f(x) ge m$.
A restated version of a recent question
IS IT POSSIBLE TO REPRESENT EVERY POSITIVE INTEGER AS NcR(N CHOOSE R) OTHER THAN THE TRIVIAL FORM "N choose N-1""
asks whether every integer greater than $1$ is in $X_1$.
The OP provided no context, so predictably, the question was put on hold, and most likely, the question will soon be closed, and eventually deleted.
It's easily shown that for fixed $n$, the values of the binomial coefficients $largebinomnk$ are strictly increasing for $2 le k le largefracn2$.
It then follows easily that the least element of $X_1$ is $largebinom42=6$, which resolves the OP's question with an answer of "no".
In the comments to the linked question, JMoravitz provides an argument (which could have been an answer), showing that no primes are in $X_1$.
A quick program to get the initial elements of $X_1$ yields the values
$$6, 10, 15, 20, 21, 28, 35, 36, 45, 55, 56, 66, 70, 78, 84, 91$$
which matches the OEIS sequence
https://oeis.org/A006987
But some questions arise . . .
Question $(1)$:$;$Is $X_2$ infinite?
I can answer this one, but not the others, at least not yet.
For question $(1)$, the answer is "yes".
Claim:
If $n,k$ are integers with $2 le k le largefracn2$, the equation
$$binomnk=binomn+1k-1$$
holds if and only if $5n^2+12n+8$ is a perfect square and
$$k=frac3n+4-sqrt5n^2+12n+82$$
Proof:
The equation
$$binomnk=binomn+1k-1$$
reduces to the quadratic equation
$$k^2-(3n+4)k+(n^2+3n+2)=0$$
hence, the quadratic formula (together with constraint $2 le k le largefracn2$) clinches the claim.
But the diophantine equation $5n^2+12n+8 = h^2$ is a Pell-type equation with infinitely many solutions in positive integers $n,h$, hence the answer to question $(1)$ is "yes".
What about the elements of $X_2$ other than those determined as described above?
More precisely, let $W_2$ be the set of integers $x$ which can be expressed in the form $largebinomnk$, where $n$ is a positive integer such that $5n^2+12n+8$ is a perfect square, and
$$k=frac3n+4-sqrt5n^2+12n+82$$
Question $(2)$:$;$Is $X_2setminusW_2$ infinite?
Some data . . .
Here are the $5$ smallest elements of $W_2$:
beginalign*
smallbullet;&smallbinom146=smallbinom155\[4pt]
smallbullet;&smallbinom10340=smallbinom10439\[4pt]
smallbullet;&smallbinom713273=smallbinom714272\[4pt]
smallbullet;&smallbinom48941870=smallbinom48951869\[4pt]
smallbullet;&smallbinom3355112816=smallbinom3355212815\[4pt]
endalign*
Here are the elements of $X_2setminusW_2$ that I've found so far:
beginalign*
smallbullet;&smallbinom162=smallbinom103\[4pt]
smallbullet;&smallbinom212=smallbinom104\[4pt]
smallbullet;&smallbinom562=smallbinom223\[4pt]
smallbullet;&smallbinom1202=smallbinom363\[4pt]
smallbullet;&smallbinom1532=smallbinom195\[4pt]
smallbullet;&smallbinom2212=smallbinom178\[4pt]
endalign*
I don't know if there are any others.
Finally, what about $X_3$?
Note that $X_3$ has at least one element, since
$$smallbinom146=smallbinom155=smallbinom782$$
Question $(3)$:$;$Is $X_3$ infinite?
elementary-number-theory diophantine-equations
asked Jul 20 at 2:01
quasi
33.3k22359
edited Jul 20 at 2:14
asked Jul 20 at 2:01
quasi
33.3k22359
asked Jul 20 at 2:01
quasi
33.3k22359
asked Jul 20 at 2:01
quasi
33.3k22359
33.3k22359
add a comment |Â
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
2
down vote
accepted
OEIS entry A003015 lists the numbers that occur $5$ or more times in Pascal's triangle. It refers to Aart Blokhuis, Andries Brouwer, Benne de Weger, Binomial collisions and near collisions, INTEGERS, Volume $17$, Article A64, $2017$: “Blokhuis et al. show that there are no other solutions less than $10^60$, nor within the first $10^6$ rows of Pascal's triangle other than those given by the parametric solution mentioned above.†The paper expresses your infinite family in terms of Fibonacci numbers, conjectures that there are no collisions other than the ones you found, and discusses the state of this conjecture.
answered Jul 20 at 6:32
joriki
164k10180328
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
2
down vote
accepted
OEIS entry A003015 lists the numbers that occur $5$ or more times in Pascal's triangle. It refers to Aart Blokhuis, Andries Brouwer, Benne de Weger, Binomial collisions and near collisions, INTEGERS, Volume $17$, Article A64, $2017$: “Blokhuis et al. show that there are no other solutions less than $10^60$, nor within the first $10^6$ rows of Pascal's triangle other than those given by the parametric solution mentioned above.†The paper expresses your infinite family in terms of Fibonacci numbers, conjectures that there are no collisions other than the ones you found, and discusses the state of this conjecture.
answered Jul 20 at 6:32
joriki
164k10180328
add a comment |Â
up vote
2
down vote
accepted
OEIS entry A003015 lists the numbers that occur $5$ or more times in Pascal's triangle. It refers to Aart Blokhuis, Andries Brouwer, Benne de Weger, Binomial collisions and near collisions, INTEGERS, Volume $17$, Article A64, $2017$: “Blokhuis et al. show that there are no other solutions less than $10^60$, nor within the first $10^6$ rows of Pascal's triangle other than those given by the parametric solution mentioned above.†The paper expresses your infinite family in terms of Fibonacci numbers, conjectures that there are no collisions other than the ones you found, and discusses the state of this conjecture.
answered Jul 20 at 6:32
joriki
164k10180328
add a comment |Â
up vote
2
down vote
accepted
up vote
2
down vote
accepted
OEIS entry A003015 lists the numbers that occur $5$ or more times in Pascal's triangle. It refers to Aart Blokhuis, Andries Brouwer, Benne de Weger, Binomial collisions and near collisions, INTEGERS, Volume $17$, Article A64, $2017$: “Blokhuis et al. show that there are no other solutions less than $10^60$, nor within the first $10^6$ rows of Pascal's triangle other than those given by the parametric solution mentioned above.†The paper expresses your infinite family in terms of Fibonacci numbers, conjectures that there are no collisions other than the ones you found, and discusses the state of this conjecture.
answered Jul 20 at 6:32
joriki
164k10180328
OEIS entry A003015 lists the numbers that occur $5$ or more times in Pascal's triangle. It refers to Aart Blokhuis, Andries Brouwer, Benne de Weger, Binomial collisions and near collisions, INTEGERS, Volume $17$, Article A64, $2017$: “Blokhuis et al. show that there are no other solutions less than $10^60$, nor within the first $10^6$ rows of Pascal's triangle other than those given by the parametric solution mentioned above.†The paper expresses your infinite family in terms of Fibonacci numbers, conjectures that there are no collisions other than the ones you found, and discusses the state of this conjecture.
answered Jul 20 at 6:32
joriki
164k10180328
answered Jul 20 at 6:32
joriki
164k10180328
answered Jul 20 at 6:32
joriki
164k10180328
answered Jul 20 at 6:32
joriki
164k10180328
164k10180328
add a comment |Â
add a comment |Â
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2857223%2fnumber-of-different-ways-to-represent-a-positive-integer-as-a-binomial-coefficie%23new-answer', 'question_page');
);
Post as a guest
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
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
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