Indexed metadata

Schäffer's conjecture for even k≤42k \le 42

Imin Chen, Stephen Choi, James Houle

Source record

Source: arXiv

Published: Oct 20, 2026

arXiv: 2610.28768

Open original source ↗

Source abstract

In 1956, Schäffer made a conjecture on the whole number solutions to the Diophantine equation Sk(x):=1k+2k+⋯+xk=ynS_k(x):=1^k+2^k+\cdots+x^k=y^n. In this paper we show how for even kk, we can descend to a long list of three coupled equations of the form Axp−Byp=1Ax^p-By^p=1, where A,B∈QA,B\in\mathbb{Q}. To this system, we apply the modular method, linear forms in logarithms, and local methods. As a result, we prove Schäffer's conjecture for even k≤42k \le 42.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Schäffer's conjecture for even $k \le 42$ — Mathematical Frontier Network