| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Proth.exe"
(Tagging variables) |
m |
||
| Line 10: | Line 10: | ||
* {{Kbn|+|1|k|n}} ([[Generalized Fermat number]]s) | * {{Kbn|+|1|k|n}} ([[Generalized Fermat number]]s) | ||
* {{Kbn|±|k|b|n}} (by default {{Vb}} is 2 but it can be changed) | * {{Kbn|±|k|b|n}} (by default {{Vb}} is 2 but it can be changed) | ||
| − | * {{Kbn|±|n|b|n}} ([[ | + | * {{Kbn|±|n|b|n}} ([[Cullen prime|Generalized Cullen]]/[[Woodall prime|Generalized Woodall]] numbers) |
Due to the age of the program, it is not optimized for use with modern processors and thus should not be used. Instead newer programs such as [[LLR]] and [[PFGW]] should be used. | Due to the age of the program, it is not optimized for use with modern processors and thus should not be used. Instead newer programs such as [[LLR]] and [[PFGW]] should be used. | ||
[[Category:Primality testing program]] | [[Category:Primality testing program]] | ||
Latest revision as of 16:44, 31 August 2021
| Workload type | primality prover |
| First release | ? |
| Latest version | 7.1 2004-05 |
Proth.exe is an ancient program that implements Proth's theorem. It is used to test the primality of the following forms:
- kn+1 (Generalized Fermat numbers)
- k•bn±1 (by default b is 2 but it can be changed)
- n•bn±1 (Generalized Cullen/Generalized Woodall numbers)
Due to the age of the program, it is not optimized for use with modern processors and thus should not be used. Instead newer programs such as LLR and PFGW should be used.
