Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Claim. Infinite rr-Powerful Sums, a one-page manuscript whose author line reads GPT-5.5 Pro, shared by Liam Price in a post of 24 May 2026 on the site's thread for Problem 939; the post attributes the argument to GPT-5.5 Pro and links a Lean file that, it says, Aristotle autoformalized from the argument. The manuscript's single theorem, stated on the library's result page: for every integer r≥6r\geq6 there are infinitely many tuples (a1,…,ar−2,N)(a_1,\ldots,a_{r-2},N) of positive integers with a1+⋯+ar−2=Na_1+\cdots+a_{r-2}=N such that a1,…,ar−2,Na_1,\ldots,a_{r-2},N are distinct rr-powerful numbers and gcd⁡(a1,…,ar−2)=1\gcd(a_1,\ldots,a_{r-2})=1. The proof expands (X+Y)r−(X−Y)r(X+Y)^r-(X-Y)^r, splits the j=3j=3 term into ⌊r/2⌋−2\lfloor r/2\rfloor-2 distinct positive multiples of Xr−3Y3X^{r-3}Y^3 to reach exactly r−2r-2 summands, and takes X=qrX=q^r, Y=BrY=B^r with BB the product of the primes in the coefficients and q>Bq>B prime. The manuscript does not argue the distinctness of the summands, which follows from their qq-adic valuations, and the Lean proof handles it explicitly. Read as the Formulation on the problem page reads the question (joint coprimality, each r≥4r\geq4), the theorem answers the first question yes and the second no at every r≥6r\geq6.

Covers. Every r≥6r\geq6: an rr-powerful sum of r−2r-2 jointly coprime rr-powerful numbers exists, and there are infinitely many. Not covered: r=4r=4 and r=5r=5, where the construction has too many terms, so neither of the first two questions is settled as a whole; and the third question.

Depends on. No page of this wiki; the argument is the manuscript's own.

Standing. Claimed. The manuscript is unrefereed and undated; the site adopted the construction into its remarks on 28 May 2026 while keeping the label OPEN, which is not acceptance. Lines 1--676 of the Lean file that Conjectures.io kernel-checked coincide with the autoformalization linked from the post, and that file proves infinite_rpowerful_sums for every r≥6r\geq6 with positive, distinct, jointly coprime summands; but the certification's target was the catalog statement without positivity, the site's review states that the record does not settle the problem and that the r≥6r\geq6 construction was not checked line by line, so no reviewed is listed (the Conjectures.io card). This corpus has not built the Lean, so no formalized is listed.