pith. sign in

arxiv: 1307.1840 · v1 · pith:CVQUK36Znew · submitted 2013-07-07 · 🧮 math.NT

Primality test for numbers of the form (2p)^(2^n)+1

classification 🧮 math.NT
keywords primalityspecialtestcertaincriteriadeducedescribeexceeding
0
0 comments X
read the original abstract

We describe a primality test for number $M=(2p)^{2^n}+1$ with odd prime $p$ and positive integer $n$. And we also give the special primality criteria for all odd primes $p$ not exceeding 19. All these primality tests run in polynomial time in log$_{2}(M)$. A certain special $2p$-th reciprocity law is used to deduce our result.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.