English

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

Number Theory 2013-07-09 v1

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.

Keywords

Cite

@article{arxiv.1307.1840,
  title  = {Primality test for numbers of the form $(2p)^{2^n}+1$},
  author = {Yingpu Deng and Dandan Huang},
  journal= {arXiv preprint arXiv:1307.1840},
  year   = {2013}
}

Comments

15 pages, 2 tables

R2 v1 2026-06-22T00:46:47.554Z