Wiki
Wiki

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

Updated

Problem 681

../


Statement. Is it true that for all large nn there exists kk such that n+kn+k is composite and

p(n+k)>k2,p(n+k)>k^2,

where p(m)p(m) is the least prime factor of mm?

Status. Open.

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

Formalization. Statement in formal-conjectures.

Progress

Not yet compiled.

Known Results

Not yet compiled.