Primeshard
0:00.0

Proth's Theorem is a primality test for 'Proth numbers', which are of the form n=k2n+1n = k \cdot 2^n + 1. What is the condition for nn to be prime?