Relaxing the Size Constraint on the Criterion of Proth
| Autor: | Tejas Rao |
|---|---|
| Rok vydání: | 2019 |
| DOI: | 10.31219/osf.io/jze5f |
| Popis: | We add one condition to Proth’s theorem 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 Proth’s theorem and thus makes it readily applicable. A note on an extension of Brillhart, Lehmer, and Selfridge’s primality test is also made. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|