加入
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.
Update from the catalog #1
已合并
+3 −1 scienceslack.json 查看文件
| @@ -16,5 +16,7 @@ | ||
| 16 | 16 | "as_of": "2026-10-20", |
| 17 | 17 | "prize": "$250", |
| 18 | 18 | "catalog": "0521c19bbd38" |
| 19 | - } | |
| 19 | + }, | |
| 20 | + "review": true, | |
| 21 | + "approval": "first-time" | |
| 20 | 22 | } |