Claims

../

1950_11_01_erdos: Theorem 1 of Erdős's 1950 paper: with f(n) the number of representations n = 2^k + p, limsup f(n) is infinite, and f(n) > c log log n for infinitely many n; the case A = {2^k} of Problem 237, refereed.

2022_01_26_chen_ding: Proves that for any infinite set of integers some integers have arbitrarily many representations as a prime plus a member, with a log log x lower bound for sets of more than log x elements up to x; refereed, credited by the site.

---