Schinzel's conjecture on the number of equal-sum-and-product solutions

Less than 1 year old · traced to

Let f1(n)f_1(n) denote the number of ordered positive-integer solutions (x1,…,xn)(x_1,\dots,x_n) to

x1+⋯+xn=x1⋯xn,x_1+\cdots+x_n=x_1\cdots x_n,

for n≥2n\geq 2.

Schinzel's conjecture.

lim⁡n→∞f1(n)=∞.\lim_{n\to\infty} f_1(n)=\infty.

The equal sum and product problem asks for a complete description of these solutions and their number. The conjecture remains open, even though explicit families of solutions and bounds for related solution counts are known.

References

Primary source

Sándor Z. Kiss, Csaba Sándor and Maciej Zakarczemny, “On the Diophantine Equation Involving Elementary Symmetric Polynomials and the Decomposition of Unity”, arXiv:2601.14057 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.