Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Coprime pairs with equal divisor sums from smooth successor primes
smooth_successor_sign_audit: Every place where the sign of 2u+1 enters the weighted-dilation manuscript's proof of its smooth-predecessor count, with the identity, divisor bound, unit class, residue count or range that replaces it for primes 2u-1; the sign-free steps remain the manuscript's unrefereed argument.
This folder's results that are not drawn from a cited source are Plasma AI's, credited to Plasma AI. The route itself is Shisheng Li and Zhong Zhuang's, recorded on their claim page: the reduction follows Pollack and Pomerance after an idea of Erdős, and the counting argument it adapts is OpenAI's weighted-dilation manuscript.
The complete conditional derivation writes out the signed Type II estimate, the sieve, and the squarefree counting reduction. It identifies the exact uniform analytic premise (P) and elementary source inputs (E), and includes an author examination of the analytic core. This page gives the route and the final counting argument; the linked derivation states the full endpoint interface.
Target
Problem 824, status open. Let count the pairs with and . The question is whether , that is, whether for every one has for all large . Pollack and Pomerance proved (their Section 6 result). Nothing here answers the question unconditionally.
The conditional route
Write for the largest prime factor of . Hypothesis is Definition 1.2 of Li and Zhuang's draft: for every and every there is such that every real has
The route has three links.
- Premises. The weighted-dilation manuscript's lifted shift-cancellation Theorem 5.1 holds uniformly for the endpoints consumed by the [[research/smooth_successor_primes/signed_type_ii|signed Type II estimate]]; this is (P). Its Section 2 estimates, candidate mass Proposition 7.1 and proxy Lemmas 7.3–7.4 supply (E). Both remain unrefereed source premises. The [[research/smooth_successor_primes/shift_sign_analytic_core|author examination of the analytic core]] does not independently establish (P).
- Sign change. Under these premises, for every fixed at least primes with have , and hence holds. This is Li and Zhuang's Theorem 1.4, with a slightly narrower range. The sign audit lists every step of the manuscript's Sections 6 and 7 at which the sign enters and proves the replacement for primes : the determinant identity of the Type II estimate and its converse, the divisor-moment bounds, the unit class of the Type I estimate, the residue counts of the sieve for balanced composites, and the final range. This compact source comparison remains author-recorded; the full conditional derivation has the separate passing grade described below.
- Reduction. implies for every and all large , with squarefree. This is Li and Zhuang's Theorem 1.3, whose proof is rederived below.
Composed, the links give the requested bound conditional on (P) and (E). The conditional whole-conclusion grade matches the surviving E scopes to this chain. An unconditional answer still requires accepted P at its full consumed uniformity, together with the explicit classical boundaries. Li and Zhuang report a Lean proof of the implication in link 3, replayed by the Palomar registry; this corpus has not built or audited it, and it is not this corpus's Lean acceptance.
The reduction from Hypothesis A+
The argument is Li and Zhuang's Section 3, with every parameter checked here. Fix , a real , and . Write , put , let be the set of primes with , and . By , for large . Let , so that and ; also for large .
Let be the set of products of distinct primes of . Each is squarefree and satisfies . Distinct sets give distinct products, and
For , is -smooth. An -smooth integer up to is with , so at most values occur and . With , Cauchy's inequality gives at least ordered pairs with .
Let . Ordered pairs sharing at least primes number at most , and since ,
With , and ,
which is negative for large . So at least ordered pairs with share fewer than primes, and for them.
For such a pair put , , . As are squarefree, , and are pairwise coprime, so gives , with , , and squarefree. Since is a product of at most primes below , ; each unordered pair therefore comes from at most ordered pairs. Hence
for large , since . Only the values of at and are used, at the point .
Standing and what remains
Links 2 and 3 have independently graded coverage through the full conditional chain. The whole conditional examination records refutation-failed for their composition from P and the operative E estimates, including every sufficiently large real input and the strict squarefree-pair conclusion; its distinct whole-contract grade is PASS, examined on 2026-10-16 UTC. The E examination has a separate passing grade for its adverse and surviving scopes, while the P grade remains VOID with zero accepted independent weight. The authors' externally replayed Lean proof covers the lower-bound implication for natural , without the squarefree addendum. No build, axiom audit or statement-fidelity audit of it is supplied here. P remains without accepted independent weight; the accepted E scopes are relative to their quoted classical premises. The problem stays open. The route still depends on the unrefereed weighted-dilation manuscript; original classical proofs and PDF fidelity remain unexamined.
The combined sketch records the exact remaining uniformity: the discrepancy exponent must be chosen before the proxy's final cell precision, for all consumed endpoints, intervals, cutoffs and both shift signs. The two signs use a common permitted class, but their separated cutoff coefficients need not coincide. Establishing only selected predecessor instances does not justify the successor count. No sign-specific failure was found; that author observation supplies no independent acceptance of the analytic estimates.