ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers nn and mm, consider the Diophantine equation

(n4)+10(n5)+15(n6)=(m2).\binom{n}{4}+10\binom{n}{5}+15\binom{n}{6}=\binom{m}{2}.

The displayed Stirling-number identity shows that this equation arises from equating {nn−3}\genfrac\{\}{0pt}{}{n}{n-3} and {mm−1}\genfrac\{\}{0pt}{}{m}{m-1}. Uniqueness conjecture. The unique solution with n≥6n\geq 6 is

(n,m)=(14,364).(n,m)=(14,364).

The authors found this as the unique solution in the computational range 6≤n≤4.6⋅1076\leq n\leq 4.6\cdot 10^7, while uniqueness for all n≥6n\geq6 remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.