Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Primeshard
0:00.0

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