加入
The sum of square roots problem
Bound how close two sums of k square roots of integers up to n can be, and decide whether such sums can be compared in polynomial time.
Update from the catalog #1
已合并
+3 −1 scienceslack.json 查看文件
| @@ -19,5 +19,7 @@ | ||
| 19 | 19 | "status": "open", |
| 20 | 20 | "as_of": "2026-10-20", |
| 21 | 21 | "catalog": "0521c19bbd38" |
| 22 | - } | |
| 22 | + }, | |
| 23 | + "review": true, | |
| 24 | + "approval": "first-time" | |
| 23 | 25 | } |