MathsClub Problems, proofs & good company

The Problems

Not schoolwork — the questions that resisted Erdős, Hilbert, and everyone since. The club keeps three shelves: what is still open, what AI recently settled, and what took humanity centuries.

Tagged distributed-computing — 1 entry. Clear

The distributed-computing classic: is 509203 the smallest k for which k·2ⁿ − 1 is never prime? PrimeGrid grinds on; the answer is a finite search away.

Posed by Hans Riesel · 1956 · Prime numbers · difficulty 3/5

prime-numbers distributed-computing