prob_prime
| Crates.io | prob_prime |
| lib.rs | prob_prime |
| version | 0.2.0 |
| source | src |
| created_at | 2018-12-11 16:31:50.602336 |
| updated_at | 2018-12-13 18:45:20.039926 |
| description | Probabilistic algorithms for checking whether integer is prime or not. Implements Rabin-Miller test and Baillie-PSW test. Strictly speaking, these are 'compositionality' tests i.e the algorithms check whether a number is composite - if deemed so (output=true) then the number is certainly composite; if the output is false, then the number is prime with high probability. |
| homepage | |
| repository | |
| max_upload_size | |
| id | 101451 |
| size | 6,701 |
(VanLeeuwarden)