Samuel Tardieu
|
f86b5baf8d
|
Use math.primes.erato instead of a list of first prime numbers
|
2008-12-26 21:03:12 +01:00 |
|
Samuel Tardieu
|
4f42d00769
|
Use existing recursion tools rather than explicit one
|
2008-12-26 20:58:46 +01:00 |
|
Samuel Tardieu
|
7303316a04
|
Do not remove first primes only to prepend them afterwards
This makes little sense to use "lprimes-from" to get the
primes above one million to prepend the list of primes
before one million afterwards.
|
2008-12-26 20:58:45 +01:00 |
Aaron Schaefer
|
774cb858d5
|
Small updates to math.primes
|
2008-11-08 16:34:39 -05:00 |
Doug Coleman
|
56a0af9628
|
initial math cleanup
|
2008-10-03 02:19:03 -05:00 |
Slava Pestov
|
ad87a38ab8
|
Refactor binary search
|
2008-07-15 17:16:08 -05:00 |
James Cash
|
8d4de9d9ed
|
Some files only need lists.lazy, not lists as well
|
2008-06-03 04:41:36 -04:00 |
|
James Cash
|
1818a743bd
|
Updating libraries that uses lazy-lists to use lists/lazy
|
2008-06-03 04:27:25 -04:00 |
|
Doug Coleman
|
439c138aa5
|
fix load errors
|
2008-04-26 11:03:41 -05:00 |
|
Doug Coleman
|
acf6132389
|
update cond/case
|
2008-04-11 12:56:48 -05:00 |
|
Samuel Tardieu
|
fe8448b4e8
|
Use more combinators
|
2008-04-04 11:20:10 +02:00 |
|
Doug Coleman
|
260acff952
|
add coprime? to math.primes
|
2008-02-27 23:09:29 -06:00 |
|
Samuel Tardieu
|
694dd297ad
|
New module math.primes
|
2007-12-27 16:52:16 +01:00 |