Deterministic Primality Proving on Proth Numbers

Details Deterministic Primality Proving on Proth Numbers Deterministic Primality Proving on Proth Numbers

2008-12-14

arxiv.org/abs/0812.2596v5

Mathematics

Number Theory

18 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Deterministic Primality Proving on Proth Numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deterministic Primality Proving on Proth Numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic Primality Proving on Proth Numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-249966