Claims

../

2026_01_21_tang: Tang, working with ChatGPT, shows that a random k-subset of F_p with k = log_2 p + o(log log p) leaves some element unreachable by subset sums with probability tending to one, refuting the bound; credited by the site.

2026_02_05_ma_tang: Ma and Tang (arXiv, February 2026) claim that for primes p the threshold f(p) is at least log_2 p + (1/(2 log 2) + o(1)) log log p, a quantitative form of the negative answer; submitted, not refereed, not site-credited.

---