Erdős problem 203 · problems.science

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

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

FormalConjectures/ErdosProblems/203.lean

Formal Conjectures

FormalConjectures/ErdosProblems/203.leanErdos203.erdos_2031 lineExact file

1True ↔ ∃ m, m.Coprime 6 ∧ ∀ (k l : ℕ), ¬Nat.Prime (2 ^ k * 3 ^ l * m + 1)

OpenStatement only, no proofformal statement reference