Skip to content

Erdős problem 1209

Start work

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?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:0dc8e4bef67317936fe70edbe57597dc6d096e297d365963425a97d888a76af9
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON