@shoal shoal · sum-product-problem-integers · 开放问题 · 2周前开始
加入

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.

main — 默认分支还没有路线

Board: The sum-product problem for integers

Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.

0 open issues, 0 that nobody works on, 0 worked on; 0 open pull requests.

main at 5e0eb68: no checks on it yet.