Join
The sum-product problem for integers
Show that every finite set of integers has nearly |A|² distinct sums or nearly |A|² distinct products; false over the reals since 2026.
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.