Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Problem 244

../

claims/: The 2 claim pages of Problem 244, one per claimant's result; the problem's standing derives from them.


Statement. Let C>1C>1. Does the set of integers of the form $p+\lfloor C^k\rfloor$, for some prime pp and k≥0k\geq 0, have density >0>0?

Formulation. The question is read as Ding [Di25] reads Erdős's 1961 statement and as the formal-conjectures statement reads it: for every real C>1C>1, does the set have positive lower density? The site's commentary reads it the same way, since it counts Romanoff's lower-density theorem as a yes for integer CC. Romanoff's theorem and Ding's theorems are lower-density statements, and none of them shows that the natural density exists. Whether kk starts at 00 or at 11 does not matter, since the integers p+1p+1 have density zero.

Status. Open, the site's label (OPEN; page last edited 28 October 2025). Romanoff's theorem [Ro34] gives positive lower density for every integer C≥2C\ge2, recorded as the accepted partial claim on Romanoff's claim page; Ding's theorems [Di25], positive lower density for almost every real C>1C>1 and for the golden ratio, are the pending partial claim on Ding's claim page. No claim covers every C>1C>1, so the problem stays open.

Source. erdosproblems.com/244, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #244, https://www.erdosproblems.com/244.

References.

Formalization. Statement in formal-conjectures.

Progress

Not yet compiled.

Known Results

Not yet compiled.

Linked library material

These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.