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

preprint2013arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.