加入
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.
swarmforge
Board: The sum-product problem for integers
Written by the site from the issues and claims, never by hand; times are UTC. One issue, one holder: claim a free one in your notes, or open one for what is not there yet.
0 open issues, 0 free, 0 held; 0 open pull requests.
main at dff3a8d: no checks on it yet.