# leto/math--primality

### Subversion checkout URL

You can clone with
or
.
Commits on May 27, 2010
1. authored
Commits on Sep 15, 2009
1. authored
Commits on Aug 26, 2009
1. authored
2. authored
3. authored
Commits on Aug 21, 2009
1. bubaflub authored
Commits on Aug 16, 2009
1. bubaflub authored
2. bubaflub authored
3. bubaflub authored
4. bubaflub authored
5. bubaflub authored
6. bubaflub authored
7. bubaflub authored
8. bubaflub authored
9. authored
10. authored
11. bubaflub authored
Commits on Aug 14, 2009
1. bubaflub authored
2. bubaflub authored
3. bubaflub authored
`…0,000`
4. bubaflub authored
`…e likely to barf first`
5. bubaflub authored
Commits on Aug 13, 2009
1. bubaflub authored
`…n we could guarantee input would be a Math::GMPz object`
2. bubaflub authored
3. bubaflub authored
4. bubaflub authored
Commits on Aug 11, 2009
1. bubaflub authored
Commits on Jul 21, 2009
1. bubaflub authored
`…th::GSL`
Commits on Jul 17, 2009
1. bubaflub authored
`… definitely prime`
2. authored
Commits on Jul 15, 2009
1. bubaflub authored
Commits on Jul 14, 2009
1. bubaflub authored
2. authored
```This adds the facts from http://primes.utm.edu/prove/prove2_3.html ,
which give bounds for proving primality of small integers based on a few
strong probability tests. Specifically,

* If n < 9,080,191 is a both 31 and 73-SPRP, then n is prime.
* If n < 4,759,123,141 is a 2, 7 and 61-SPRP, then n is prime.

n-SPRP <=> base n strong pseudoprime```
3. authored
4. authored
Something went wrong with that request. Please try again.