✦ 5 frontiers

read-only vieweressays

erdős #682

← #681 · #683 → (packet.json; erdosproblems.com)

Is it true that for almost all $n$ there exists some $m \in (p_{n}, p_{n + 1})$ such that $p (m) \geq p_{n + 1} - p_{n},$ where $p (m)$ denotes the least prime factor of $m$ ?

Worked, still open.

number theory · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

oeis

A386978 — Numbers k such that the k-th prime gap contains an integer whose least prime factor is greater than or equal to the length of the prime gap.2,3,5,7,10,13,15,17,20,21,26,28,32,33,34,35,37,39,41,42,43,45,47,49,52,53,54,55,57,60,61,64,66,68,69,72,73,74,77,79,81,8

links

Dickson's conjecture · reference

Create a formalisation here · link

status

solved

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub