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

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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…