arXiv:1307.1840 [math.NT]AbstractReferencesReviewsResources
Primality test for numbers of the form $(2p)^{2^n}+1$
Published 2013-07-07Version 1
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.
Comments: 15 pages, 2 tables
Categories: math.NT
Related articles: Most relevant | Search more
arXiv:1012.3919 [math.NT] (Published 2010-12-17)
Constructing $x^2$ for primes $p=ax^2+by^2$
arXiv:1405.7294 [math.NT] (Published 2014-05-28)
A converse to a theorem of Gross, Zagier, and Kolyvagin
arXiv:1409.2463 [math.NT] (Published 2014-09-08)
On the Diophantine equation X^{2N} + 2^{2 alpha} 5^{2 beta} p^{2 gamma} = Z^5