number-theory / Combinatorial number theory

The Umans-Wang Arithmetic-Progression Divisor Conjecture

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.

18Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

number-theoryAug 7, 2026Significance 18/100Registry: unreviewed

The Umans-Wang Arithmetic-Progression Divisor Conjecture

Prior state unknowndisproved

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.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

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.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.