| 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"
m |
(Tagging variables) |
||
| Line 5: | Line 5: | ||
|latest=7.1<br>2004-05 | |latest=7.1<br>2004-05 | ||
}} | }} | ||
| + | |||
'''Proth.exe''' is an ancient program that implements [[Proth's theorem]]. It is used to test the primality of the following forms: | '''Proth.exe''' is an ancient program that implements [[Proth's theorem]]. It is used to test the primality of the following forms: | ||
| − | *k | + | |
| − | *k | + | * {{Kbn|+|1|k|n}} ([[Generalized Fermat number]]s) |
| − | *n | + | * {{Kbn|±|k|b|n}} (by default {{Vb}} is 2 but it can be changed) |
| + | * {{Kbn|±|n|b|n}} ([[Gen Cullen prime|Generalized Cullen]]/[[Gen 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]] | ||
Revision as of 02:08, 8 November 2020
| 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.
