Abstract
We describe a primality test for number M=(2p) 2 n + 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
