Talk:Algorithm Implementation/Mathematics/Primality Testing

Probabilistic
The opening verbiage "In practice, primality testing for numbers of a size suitable for cryptographic applications has to be done in a probabilistic way...." is not precisely true, due to the deterministic AKS algorithm AKS_primality_test and at least one other. It would hold if the meaning was that AKS takes too long for those cryptographic numbers.--Billymac00 (discuss • contribs) 22:31, 28 August 2016 (UTC)

Other tests
This test can be seen implemented in many script languages at the rosettacode site here:1. Some others seen there include the AKS algorithm and Lucas-Lehmer.--Billymac00 (discuss • contribs) 01:58, 3 January 2017 (UTC)