Problem detail · source-aware
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
An $n$-divisor set contains a multiple of every integer from 1 to $n$. Umans and Wang proposed, as the arithmetic-progression form of their Strong $(\alpha,\beta)$-Divisor Conjecture, that such a progression exists with few terms of bounded magnitude, which would imply faster algorithms for polynomial and integer factorization. Refuted unconditionally, including its exponent-level relaxation.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.
"The proof was discovered in an OpenAI Codex run using the gpt-5.6-sol model with reasoning effort set to ultra. Codex also produced the initial write-up. Subsequent human review verified the proof, reviewed the citations, and revised the exposition." The authors note the prompting strategy borrowed from the UCLA Moonshot Harness project.
Provider: OpenAI · Prompt public: unknown · Independence: unknown
A preprint days old with no independent review. The paper states the argument is self-contained, needs no computer-assisted calculation and no access to the model transcript, with the prime number theorem as its only analytic input, so it is checkable on its own terms.
Correctness: unknown · statement fidelity: unaudited · peer review: none
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Source-reported tools: argument.
Independent: unknown · difference confidence: 0
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.