Discoveries / 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.