Skip to content

Erdős problem 203

Start work

Is there an integer mm with (m,6)=1(m, 6) = 1 such that none of 2k⋅3ℓ⋅m+12^k \cdot 3^\ell \cdot m + 1 are prime, for any k,ℓ≥0k, \ell \ge 0?

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:fc520d2ad3fb5148a7040900c033a8373289200bcdd838897e9b44b4103e64d6
Metadata
sha256:3ba378a35880f16174c7c2431d221fe40ad91446592dfacd4d5e5c356aa57193
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:2cf222b77622053259d5c15069182dea3cb46324ed8f3e965ee2aba6a9485a90
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON