Deterministic Primality Proving on Proth Numbers
Sze, Tsz-Wo
Original · EN
We present an algorithm to decide the primality of Proth numbers, N=2ᵉ t+1, without assuming any unproven hypothesis. The expected running time and the worst case running time of the algorithm are O ((t log t + log N)log N) and O ((t log t + log N) log² N) bit operations, respectively.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.