Skip to content

Erdős problem 203

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

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:2cf222b77622053259d5c15069182dea3cb46324ed8f3e965ee2aba6a9485a90
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page