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.
Show that every finite set of integers has nearly |A|² distinct sums or nearly |A|² distinct products; false over the reals since 2026.
shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.