arXiv · 1306.4562
Primality Test for Numbers of the Form Ap^n+w
Abstract
We propose an algorithm determining the primality of numbers $M=Ap^n+w_n$ where $w_n^{p-1}\equiv1\pmod{p^n}$ and $A<p^n$ and give example when $p=7$. $p$ th reciprocity law is involved. The algorithm runs in polynomial time in $\log_2(M)$ for fixed $p$ and $A$.
Explore related subjects
Keep this discovery
Yingpu Deng, Chang Lv. 2013-06-19. Primality Test for Numbers of the Form Ap^n+w. https://doi.org/10.1016/j.jda.2015.03.003
Cite the original work for its findings. Save a collection to share your selection of sources.