Skip to content

Erdős problem 1209

Let A={a1<a2<}A=\{a_1<a_2<\cdots\} be a sequence of integers which tends to infinity sufficiently fast. If there is an nn such that all n+akn+a_k are primes then must there exist infinitely many such nn?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:5451b948d38dfb3240fdc2fb6302866e0053cc155e5bd6867bacb02a539ce03d
Metadata
sha256:876715907d7a14b0de8d0997c81fadf13ac6345ced8c5df6e501cbee2e69fbf3
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:0dc8e4bef67317936fe70edbe57597dc6d096e297d365963425a97d888a76af9
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page