Deterministic Primality Proving on Proth Numbers
Number Theory
2011-07-05 v5
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.
Cite
@article{arxiv.0812.2596,
title = {Deterministic Primality Proving on Proth Numbers},
author = {Tsz-Wo Sze},
journal= {arXiv preprint arXiv:0812.2596},
year = {2011}
}
Comments
18 pages