Yingpu Deng, Dandan Huang
Abstract
Open-access reader
We describe a primality test for $M=(2p)^{2^n}+1$ with an odd prime $p$ and a positive integer $n$, which are a particular type of generalized Fermat numbers. We also present special primality criteria for all odd prime numbers $p$ not exceeding $19$. All
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We describe a primality test for $M=(2p)^{2^n}+1$ with an odd prime $p$ and a positive integer $n$, which are a particular type of generalized Fermat numbers. We also present special primality criteria for all odd prime numbers $p$ not exceeding $19$. All
Key concepts: Primality test, Mathematics, Fermat's Last Theorem, Prime (order theory), Integer (computer science), Combinatorics, Discrete mathematics, Arithmetic