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

From MaRDI portal
Publication:5261959

DOI10.4064/AA169-4-1zbMATH Open1370.11139arXiv1307.1840OpenAlexW2793181854MaRDI QIDQ5261959FDOQ5261959


Authors: Yingpu Deng, Dandan Huang Edit this on Wikidata


Publication date: 8 July 2015

Published in: Acta Arithmetica (Search for Journal in Brave)

Abstract: We describe a primality test for number M=(2p)2n+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 log2(M). A certain special 2p-th reciprocity law is used to deduce our result.


Full work available at URL: https://arxiv.org/abs/1307.1840




Recommendations




Cites Work


Cited In (10)

Uses Software





This page was built for publication: Primality test for numbers of the form \((2p)^{2^n}+1\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261959)