Mercurial > hg > octave-nkf
annotate scripts/specfun/primes.m @ 19296:fbe5a2dd64ae
primes.m: Fix failing BIST test introduced in cset 90dd85369c2e.
* primes.m: Fix failing BIST test introduced in cset 90dd85369c2e.
author | Rik <rik@octave.org> |
---|---|
date | Sat, 20 Sep 2014 10:43:47 -0700 |
parents | 90dd85369c2e |
children | 0f9c5a15c8fa |
rev | line source |
---|---|
17744
d63878346099
maint: Update copyright notices for release.
John W. Eaton <jwe@octave.org>
parents:
14868
diff
changeset
|
1 ## Copyright (C) 2000-2013 Paul Kienzle |
5827 | 2 ## |
3 ## This file is part of Octave. | |
4 ## | |
5 ## Octave is free software; you can redistribute it and/or modify it | |
6 ## under the terms of the GNU General Public License as published by | |
7016 | 7 ## the Free Software Foundation; either version 3 of the License, or (at |
8 ## your option) any later version. | |
5827 | 9 ## |
10 ## Octave is distributed in the hope that it will be useful, but | |
11 ## WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
13 ## General Public License for more details. | |
14 ## | |
15 ## You should have received a copy of the GNU General Public License | |
7016 | 16 ## along with Octave; see the file COPYING. If not, see |
17 ## <http://www.gnu.org/licenses/>. | |
5827 | 18 |
19 ## -*- texinfo -*- | |
20 ## @deftypefn {Function File} {} primes (@var{n}) | |
11587
c792872f8942
all script files: untabify and strip trailing whitespace
John W. Eaton <jwe@octave.org>
parents:
11523
diff
changeset
|
21 ## Return all primes up to @var{n}. |
5827 | 22 ## |
19288 | 23 ## The output data class (double, single, uint32, etc.) is the same as |
24 ## the input class of @var{n}. The algorithm used is the Sieve of | |
25 ## Eratosthenes. | |
9141
c1fff751b5a8
Update section 17.1 (Utility Functions) of arith.txi
Rik <rdrider0-list@yahoo.com>
parents:
8920
diff
changeset
|
26 ## |
19288 | 27 ## Notes: If you need a specific number of primes you can use the |
11469
c776f063fefe
Overhaul m-script files to use common variable name between code and documentation.
Rik <octave@nomad.inbox5.com>
parents:
10791
diff
changeset
|
28 ## fact that the distance from one prime to the next is, on average, |
9165
8c71a86c4bf4
Update section 17.5 (Utility Functions) of arith.txi
Rik <rdrider0-list@yahoo.com>
parents:
9141
diff
changeset
|
29 ## proportional to the logarithm of the prime. Integrating, one finds |
8c71a86c4bf4
Update section 17.5 (Utility Functions) of arith.txi
Rik <rdrider0-list@yahoo.com>
parents:
9141
diff
changeset
|
30 ## that there are about @math{k} primes less than |
8c71a86c4bf4
Update section 17.5 (Utility Functions) of arith.txi
Rik <rdrider0-list@yahoo.com>
parents:
9141
diff
changeset
|
31 ## @tex |
8c71a86c4bf4
Update section 17.5 (Utility Functions) of arith.txi
Rik <rdrider0-list@yahoo.com>
parents:
9141
diff
changeset
|
32 ## $k \log (5 k)$. |
8c71a86c4bf4
Update section 17.5 (Utility Functions) of arith.txi
Rik <rdrider0-list@yahoo.com>
parents:
9141
diff
changeset
|
33 ## @end tex |
8c71a86c4bf4
Update section 17.5 (Utility Functions) of arith.txi
Rik <rdrider0-list@yahoo.com>
parents:
9141
diff
changeset
|
34 ## @ifnottex |
14868
5d3a684236b0
maint: Use Octave coding conventions for cuddling parentheses in scripts directory
Rik <octave@nomad.inbox5.com>
parents:
14363
diff
changeset
|
35 ## k*log (5*k). |
9165
8c71a86c4bf4
Update section 17.5 (Utility Functions) of arith.txi
Rik <rdrider0-list@yahoo.com>
parents:
9141
diff
changeset
|
36 ## @end ifnottex |
19288 | 37 ## |
38 ## See also @code{list_primes} if you need a specific number @var{n} of | |
39 ## primes. | |
9165
8c71a86c4bf4
Update section 17.5 (Utility Functions) of arith.txi
Rik <rdrider0-list@yahoo.com>
parents:
9141
diff
changeset
|
40 ## @seealso{list_primes, isprime} |
5827 | 41 ## @end deftypefn |
42 | |
43 ## Author: Paul Kienzle | |
11472
1740012184f9
Use uppercase for variable names in error() strings to match Info documentation. Only m-files done.
Rik <octave@nomad.inbox5.com>
parents:
11469
diff
changeset
|
44 ## Author: Francesco Potortì |
5827 | 45 ## Author: Dirk Laurie |
46 | |
19288 | 47 function p = primes (n) |
5827 | 48 |
49 if (nargin != 1) | |
50 print_usage (); | |
51 endif | |
52 | |
11469
c776f063fefe
Overhaul m-script files to use common variable name between code and documentation.
Rik <octave@nomad.inbox5.com>
parents:
10791
diff
changeset
|
53 if (! isscalar (n)) |
11472
1740012184f9
Use uppercase for variable names in error() strings to match Info documentation. Only m-files done.
Rik <octave@nomad.inbox5.com>
parents:
11469
diff
changeset
|
54 error ("primes: N must be a scalar"); |
5827 | 55 endif |
56 | |
19288 | 57 if (n > 100e3) |
8506 | 58 ## Optimization: 1/6 less memory, and much faster (asymptotically) |
19288 | 59 ## 100K happens to be the cross-over point for Paul's machine; |
5827 | 60 ## below this the more direct code below is faster. At the limit |
61 ## of memory in Paul's machine, this saves .7 seconds out of 7 for | |
11469
c776f063fefe
Overhaul m-script files to use common variable name between code and documentation.
Rik <octave@nomad.inbox5.com>
parents:
10791
diff
changeset
|
62 ## n = 3e6. Hardly worthwhile, but Dirk reports better numbers. |
c776f063fefe
Overhaul m-script files to use common variable name between code and documentation.
Rik <octave@nomad.inbox5.com>
parents:
10791
diff
changeset
|
63 lenm = floor ((n+1)/6); # length of the 6n-1 sieve |
c776f063fefe
Overhaul m-script files to use common variable name between code and documentation.
Rik <octave@nomad.inbox5.com>
parents:
10791
diff
changeset
|
64 lenp = floor ((n-1)/6); # length of the 6n+1 sieve |
10657
c6833d31f34e
optimize primes and isprime
Jaroslav Hajek <highegg@gmail.com>
parents:
10549
diff
changeset
|
65 sievem = true (1, lenm); # assume every number of form 6n-1 is prime |
c6833d31f34e
optimize primes and isprime
Jaroslav Hajek <highegg@gmail.com>
parents:
10549
diff
changeset
|
66 sievep = true (1, lenp); # assume every number of form 6n+1 is prime |
5827 | 67 |
14868
5d3a684236b0
maint: Use Octave coding conventions for cuddling parentheses in scripts directory
Rik <octave@nomad.inbox5.com>
parents:
14363
diff
changeset
|
68 for i = 1:(sqrt (n)+1)/6 # check up to sqrt (n) |
5827 | 69 if (sievem(i)) # if i is prime, eliminate multiples of i |
10657
c6833d31f34e
optimize primes and isprime
Jaroslav Hajek <highegg@gmail.com>
parents:
10549
diff
changeset
|
70 sievem(7*i-1:6*i-1:lenm) = false; |
c6833d31f34e
optimize primes and isprime
Jaroslav Hajek <highegg@gmail.com>
parents:
10549
diff
changeset
|
71 sievep(5*i-1:6*i-1:lenp) = false; |
5827 | 72 endif # if i is prime, eliminate multiples of i |
73 if (sievep(i)) | |
10657
c6833d31f34e
optimize primes and isprime
Jaroslav Hajek <highegg@gmail.com>
parents:
10549
diff
changeset
|
74 sievep(7*i+1:6*i+1:lenp) = false; |
c6833d31f34e
optimize primes and isprime
Jaroslav Hajek <highegg@gmail.com>
parents:
10549
diff
changeset
|
75 sievem(5*i+1:6*i+1:lenm) = false; |
5827 | 76 endif |
77 endfor | |
19288 | 78 p = sort ([2, 3, 6*find(sievem)-1, 6*find(sievep)+1]); |
79 elseif (n > 352) # nothing magical about 352; must be > 2 | |
11469
c776f063fefe
Overhaul m-script files to use common variable name between code and documentation.
Rik <octave@nomad.inbox5.com>
parents:
10791
diff
changeset
|
80 len = floor ((n-1)/2); # length of the sieve |
10657
c6833d31f34e
optimize primes and isprime
Jaroslav Hajek <highegg@gmail.com>
parents:
10549
diff
changeset
|
81 sieve = true (1, len); # assume every odd number is prime |
14868
5d3a684236b0
maint: Use Octave coding conventions for cuddling parentheses in scripts directory
Rik <octave@nomad.inbox5.com>
parents:
14363
diff
changeset
|
82 for i = 1:(sqrt (n)-1)/2 # check up to sqrt (n) |
5827 | 83 if (sieve(i)) # if i is prime, eliminate multiples of i |
10657
c6833d31f34e
optimize primes and isprime
Jaroslav Hajek <highegg@gmail.com>
parents:
10549
diff
changeset
|
84 sieve(3*i+1:2*i+1:len) = false; # do it |
5827 | 85 endif |
86 endfor | |
19288 | 87 p = [2, 1+2*find(sieve)]; # primes remaining after sieve |
5827 | 88 else |
89 a = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, ... | |
10549 | 90 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, ... |
91 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, ... | |
92 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, ... | |
93 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, ... | |
94 293, 307, 311, 313, 317, 331, 337, 347, 349]; | |
19288 | 95 p = a(a <= n); |
96 endif | |
97 | |
98 if (! isa (n, "double")) | |
99 cast (p, class (n)); | |
5827 | 100 endif |
101 | |
102 endfunction | |
12815
918610ea2f34
codesprint: new tests for specfun directory
John W. Eaton <jwe@octave.org>
parents:
11587
diff
changeset
|
103 |
14363
f3d52523cde1
Use Octave coding conventions in all m-file %!test blocks
Rik <octave@nomad.inbox5.com>
parents:
14138
diff
changeset
|
104 |
f3d52523cde1
Use Octave coding conventions in all m-file %!test blocks
Rik <octave@nomad.inbox5.com>
parents:
14138
diff
changeset
|
105 %!assert (size (primes (350)), [1, 70]) |
f3d52523cde1
Use Octave coding conventions in all m-file %!test blocks
Rik <octave@nomad.inbox5.com>
parents:
14138
diff
changeset
|
106 %!assert (primes (357)(end), 353) |
12815
918610ea2f34
codesprint: new tests for specfun directory
John W. Eaton <jwe@octave.org>
parents:
11587
diff
changeset
|
107 |
14363
f3d52523cde1
Use Octave coding conventions in all m-file %!test blocks
Rik <octave@nomad.inbox5.com>
parents:
14138
diff
changeset
|
108 %!error primes () |
f3d52523cde1
Use Octave coding conventions in all m-file %!test blocks
Rik <octave@nomad.inbox5.com>
parents:
14138
diff
changeset
|
109 %!error primes (1, 2) |
19296
fbe5a2dd64ae
primes.m: Fix failing BIST test introduced in cset 90dd85369c2e.
Rik <rik@octave.org>
parents:
19288
diff
changeset
|
110 %!error <N must be a scalar> primes (ones (2,2)) |
12815
918610ea2f34
codesprint: new tests for specfun directory
John W. Eaton <jwe@octave.org>
parents:
11587
diff
changeset
|
111 |