arXiv · 0812.2596
Deterministic Primality Proving on Proth Numbers
Abstract
We present an algorithm to decide the primality of Proth numbers, N=2^e 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^2 N) bit operations, respectively.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Tsz-Wo Sze. 2011-07-04. Deterministic Primality Proving on Proth Numbers. https://arxiv.org/abs/0812.2596
Cite the original work for its findings. Save a collection to share your selection of sources.