2fd5654473
Add EOL at EOF for all authors.txt files for consistency
...
In some instances replaced CR/LF with LF.
2016-07-30 09:25:30 -07:00
41209a3a42
summary.txt: Delete empty lines and empty files.
2016-03-30 22:11:51 -07:00
35d84c6e64
maths.primes: finish renaming fast-gcd to simple-gcd.
2016-03-19 17:21:24 -07:00
ceb75057da
change ERROR: words from throw-foo back to foo.
2015-08-13 16:13:05 -07:00
b6be8685c3
basis: ERROR: changes.
2015-08-13 03:20:39 -07:00
6e9dfc86c3
math.primes: commas look better.
2015-07-14 17:35:52 -07:00
892c62e1dc
factor: second stab at [ ] [ ] unit-test -> { } [ ] unit-test
2015-07-03 09:39:59 -07:00
59f3b1ea57
Revert "factor: rename [ ] [ ] unit-test -> { } [ ] unit-test using a refactoring tool!"
...
Needs a bit more work.
This reverts commit 7e54cc2824
2015-07-02 13:47:06 -07:00
7e54cc2824
factor: rename [ ] [ ] unit-test -> { } [ ] unit-test using a refactoring tool!
2015-07-02 11:36:08 -07:00
999aa7c897
factor: clean up spaces in -tests files
2015-07-02 10:34:01 -07:00
fda90b2beb
math.primes.erato: add some comments at the top.
2015-06-17 10:19:00 -07:00
8b6c743e02
math.primes.erato.fast: use literals to show how the wheel is calculated.
2015-06-16 18:44:08 -07:00
64db5c5bb4
math.primes.erato: faster compressed sieve by two improvements:
...
1) fixnum math in unmark-multiples
2) 3 upper sqrt 2 <range> in sieve
2015-06-16 08:26:48 -07:00
7e23c12c0f
math.primes.erato.fast: some bignum fixes and more tests.
2015-06-16 08:20:32 -07:00
e3ec051527
math.primes: fix "11 >bignum prime?".
2015-06-15 23:02:39 -07:00
db42e12853
math.primes.erato.fast: adding fast Sieve of Eratosthenes.
2015-06-15 19:51:02 -07:00
40b699cc1e
math.primes: little bit more cleanup.
2015-05-13 15:17:15 -07:00
ab50fc818f
math.primes: use fast-gcd in coprime? and replicate instead of make.
2015-05-13 14:47:31 -07:00
1aa27963d2
math.primes.miller-rabin: actually, this is better.
2014-12-04 19:48:32 -08:00
9d4336d774
math.primes.miller-rabin: minor cleanup;
2014-12-04 19:46:30 -08:00
34160212d1
math.primes.erato: fix reference to "arr".
2014-12-04 11:52:56 -08:00
d5b8f3d3b9
math.primes.erato: fix help-lint.
2014-12-04 11:48:12 -08:00
ad71f79be3
math.primes: speedup sieve.
2014-12-04 10:11:32 -08:00
2c3dd8c3c8
Remove executable bit from tons of files that aren't
2014-11-05 20:40:42 -08:00
57f9d78892
improve help by linking to types directly.
2014-05-23 20:20:15 -07:00
eaa19eb36f
math.primes.erato: minor performance improvements.
2012-10-23 10:49:45 -07:00
dd2a5729a7
math.primes.erato: bit faster by inlining.
2012-08-23 09:35:09 -07:00
cf54ce8e42
math.functions: when gcd is inlined, "gcd nip" is almost as good as "gcd*".
2011-10-18 10:30:39 -07:00
ac98269f53
math.functions: faster gcd means faster ratios.
2011-10-17 20:36:28 -07:00
81714b8dc3
More lint cleanups.
2011-10-16 19:33:16 -07:00
b653360299
math.primes.safe: fix docs.
2011-09-12 10:56:39 -07:00
9f34c9c676
Spelling fixes to documentation.
2011-08-26 16:20:31 -07:00
23fe76160a
Add math.primes:nprimes
2011-05-20 12:38:27 +02:00
f60f13c675
math.primes.erato doc fixes.
2010-11-02 17:34:28 +01:00
cd28c7a219
math.primes.erato: Fix off-by-one error
...
The sieve bit vector deals with numbers in chunks of 30. Therefore,
the number 90 (say) is the 91st 'element' of the vector. Each byte
deals with some range {0,1,...,29}+30n so to have the number 90, you
need four bytes.
Rather pleasingly, I bumped into this bug and it reduced to the
incantation:
2010 2010 sieve marked-prime?
2010-11-02 17:34:24 +01:00
ee1520f683
math.primes.erato: fix typo in docs
2010-10-22 18:26:08 -07:00
4fcdb2fbd5
divisors returns empty list for 0
...
This is mainly for consistency with other words
(factors, group-factors, unique-factors)
2010-08-09 22:54:35 -07:00
b3a866173a
Fix "primes-between" and "primes-upto" with pathological bounds.
...
"primes-between" was buggy when bounds were given in the wrong order
or when the high bound was smaller than 3.
2010-06-11 16:07:52 +02:00
bdecd564a3
Use keys/values where appropriate
2010-05-21 12:48:04 -05:00
4c71d71907
random is generic now -- iota random -> random
2010-01-14 12:48:57 -06:00
df4fb4a3ee
Removing integers-as-sequences
2010-01-15 07:15:33 +13:00
ae9bca2b1e
add MAIN: run-unix-factor to math.primes.factors
2009-12-12 23:39:59 -06:00
0612bc6177
Factor source files should not be executable
2009-11-21 17:50:43 -06:00
1d12a6707d
sigma -> map-sum
2009-10-29 14:34:04 -05:00
6e1bffb1c5
update existing code to use :> ( ) when possible
2009-10-28 16:11:33 -05:00
1b4e3cb7a6
fix more docs typos
2009-10-21 18:11:24 -05:00
405e5d015b
docs: change $subsection to $subsections
2009-10-02 12:15:48 -04:00
d23286a9ef
Do not repeat sanity tests at each iteration
2009-09-09 21:35:24 +02:00
21a89bab0e
Make "divisors" work with 1 as well
2009-09-02 12:07:23 +02:00
e5897d52b2
Ensure that random-prime result has the right size
...
As noted by Slava, choosing the next prime following a random number
with a specified number of bits may give a number one more bit long.
2009-08-29 21:42:15 +02:00
Alexander Iljin
Doug Coleman
John Benediktsson
Benjamin Pollack
Samuel Tardieu
Jon Harper
Rupert Swarbrick
Slava Pestov
Joe Groff
Keith Lazuka