See https://manifold.markets/jatloe/will-manifold-solve-my-math-problem. Resolves N/A if no solution is ever provided.
Update 2026-02-02 (PST) (AI summary of creator comment): The creator will resolve this market YES if no objections are raised within one day. The market close time will be extended by one day to allow for objections.
1,000🏅 Top traders
| # | Trader | Total profit |
|---|---|---|
| 1 | Ṁ37 | |
| 2 | Ṁ33 | |
| 3 | Ṁ8 | |
| 4 | Ṁ7 | |
| 5 | Ṁ5 |
https://latex.artofproblemsolving.com/miscpdf/sheishio.pdf?t=1770053481678
I can fill in the approximations if really needed but most of them should be easy to error-bound.
The general idea is the following: If you have a set in B that is smaller than everything you've found so far (say T), then either something of size n-(sqrtn ish) is a superset of T but not a superset of anything found so far, or some set we have currently found is an edit distance of (sqrt n ish) away from T. Either way, we can then recover some new set in e^(sqrt n ish) time or terminate the algorithm.
