41d804ddbd
Pack primes numbers by slices of 30
...
In any given 30 successive integers greater than 5, there are at most
8 prime numbers. Use this to tightly pack the result of the Eratostene
sieve. This lets us store more prime numbers than before in less space.
2009-06-24 13:15:12 +02:00
23e3c55d2f
dont load safe primes in miller rabin tests
2009-05-10 14:08:03 -05:00
e946777fbb
link to prime tests from prime docs
2009-05-10 14:01:21 -05:00
bfb3507456
make a new vocabulary for safe primes
2009-05-10 13:49:40 -05:00
8f51f87a8f
more docs for math.primes, move words out of miller-rabin
2009-05-10 13:47:51 -05:00
0801dbc694
add lucas-lehmer primality test
2009-05-10 12:59:35 -05:00
79265b50d9
update usages of miller-rabin
2009-05-10 12:24:43 -05:00
6b1f60f550
move math.miller-rabin to math.primes.miller-rabin
2009-05-10 12:24:19 -05:00
ed9a63311c
Fix typo and update a combinator usage in calendar
2009-04-01 22:03:45 -04:00
ca9fb1fcf1
Update usages of divisor? where appropriate
2009-04-01 21:53:18 -04:00
b5e08a8e3e
When a factor has been found, check if the remainder is a prime number
...
Performances are greatly increased when a large prime number is involved.
Also, mark some words as flushable, even if it is unlikely that they
will be invoked if their result is discarded.
2009-03-02 19:05:54 +01:00
087d931c36
Remove the tail argument from do/until/while
2009-02-18 02:41:14 +01:00
0069547e90
Fix suboptimal prime number factoring
2009-02-03 00:33:12 +01:00
6a2f46ed7f
Move math.primes.factors from extra to basis
2009-01-07 23:01:27 +01:00
594bd3aee8
Move math.primes from extra to basis
2009-01-07 21:12:48 +01:00
Samuel Tardieu
Doug Coleman
Aaron Schaefer