Relaxing the size constraints on the criterion of Proth

We add one condition to the theorem of Proth to extend its applicability to \(N=k2^n+1\) where \(2^n>N^{1/3}\) as opposed to the former constraint of \(2^n>k\). This additional condition adds barely any complexity or time to the test and can furthermore be calculated concurrently. Furthermore,...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Author Rao, Tejas R
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 27.12.2018
Subjects
Theorems
Online AccessGet full text

Cover

More Information
Summary:We add one condition to the theorem of Proth to extend its applicability to \(N=k2^n+1\) where \(2^n>N^{1/3}\) as opposed to the former constraint of \(2^n>k\). This additional condition adds barely any complexity or time to the test and can furthermore be calculated concurrently. Furthermore, it maintains the biconditionality of the theorem and thus makes it readily applicable. A note on an extension of the primality test of Brillhart, Lehmer, and Selfridge is also made.
ISSN:2331-8422