8ec8cdfffa
math.primes.twins: Use clump here.
2013-03-24 01:10:08 -07:00
449814a387
math.primes.twins: calculating twin primes.
2012-04-19 15:14:31 -07:00
3f3d57032b
Delete empty unit tests files, remove 1- and 1+, reorder IN: lines in a lot of places, minor refactoring
2009-08-13 19:21:44 -05:00
b4afea0bfd
math.primes.list: update for lists.lazy changes
2009-05-16 16:58:11 -05:00
6a2f46ed7f
Move math.primes.factors from extra to basis
2009-01-07 23:01:27 +01:00
397790241f
math.primes.factors rewrite
2009-01-07 22:54:03 +01:00
594bd3aee8
Move math.primes from extra to basis
2009-01-07 21:12:48 +01:00
ca7ffd6ea2
Separate lazy lists from core primes number generation
2009-01-07 21:10:34 +01:00
c8be645eb1
Remove "primes-under-million" list
...
In the past, this was a static list used to optimize prime factors
computation. Now that the dependency has been reversed, there is
no point in keeping this list which can be obtained by
"1000000 primes-upto" as easily.
2009-01-07 10:40:00 +01:00
5d988b04fa
Add missing files in math.primes.erato and add copyright notice
2009-01-07 10:39:55 +01:00
78fbeda105
Refactor prime factors decomposition module and add more tests
2009-01-07 10:39:20 +01:00
f521805bb3
Memoize small primes list
...
This makes "benchmark.binary-search" work again in a reasonable time.
2008-12-29 13:55:47 +01:00
ca0f3659e4
Optimize primes-between
...
Rather than having primes-between return a slice of primes-upto,
make primes-upto use primes-between.
Also, those two words cannot be marked as foldable as their
output is mutable.
2008-12-28 11:43:13 +01:00
a843113326
Optimize erato sieve
...
We started crossing the numbers at 3*n, while we can start at n^2.
2008-12-28 11:43:13 +01:00
99023a3322
Use regular primality test to build primes list
2008-12-26 21:03:12 +01:00
f86b5baf8d
Use math.primes.erato instead of a list of first prime numbers
2008-12-26 21:03:12 +01:00
93b20967b5
Add Eratosthene sieve as math.primes.erato
2008-12-26 20:58:46 +01:00
4f42d00769
Use existing recursion tools rather than explicit one
2008-12-26 20:58:46 +01:00
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
774cb858d5
Small updates to math.primes
2008-11-08 16:34:39 -05:00
56a0af9628
initial math cleanup
2008-10-03 02:19:03 -05:00
cf80dd122a
Updating code for make and fry changes
2008-09-10 22:11:40 -05:00
ad890e8a31
if-empty changes
2008-09-06 17:15:25 -05:00
8aa6f673aa
Optimizations and load fixes
2008-08-24 03:59:37 -05:00
ad87a38ab8
Refactor binary search
2008-07-15 17:16:08 -05:00
0ca627051e
Changing vocabs USING: to reflect which words are in lists and lists.lazy
2008-06-03 16:57:29 -04:00
1bd222228c
Making sure that vocabs only have lists or lists.lazy if they need them
2008-06-03 05:06:52 -04:00
8d4de9d9ed
Some files only need lists.lazy, not lists as well
2008-06-03 04:41:36 -04:00
1818a743bd
Updating libraries that uses lazy-lists to use lists/lazy
2008-06-03 04:27:25 -04:00
439c138aa5
fix load errors
2008-04-26 11:03:41 -05:00
acf6132389
update cond/case
2008-04-11 12:56:48 -05:00
fe8448b4e8
Use more combinators
2008-04-04 11:20:10 +02:00
5af2be3798
More documentation fixes
2008-03-11 21:01:39 -05:00
260acff952
add coprime? to math.primes
2008-02-27 23:09:29 -06:00
875a6fdc6e
Remove 6.26Kb of trailing whitespace from math.primes.list
2008-02-07 22:24:54 -05:00
1c91a286e5
Updating summary and authors
2008-01-27 01:02:31 -04:00
8bc631f5ed
Rename count-factors to group-factors and update docs
2008-01-14 11:33:08 -05:00
12b24af934
Simplify totient in math.primes.factors
2008-01-14 02:38:23 -05:00
e17a77f5cd
New module math.primes.factors
2007-12-27 16:52:18 +01:00
694dd297ad
New module math.primes
2007-12-27 16:52:16 +01:00
a96457cecc
Initial import
2007-09-20 18:09:08 -04:00
Doug Coleman
John Benediktsson
Slava Pestov
Samuel Tardieu
Aaron Schaefer
James Cash
Slava Pestov
Slava Pestov