Mercurial > hg > octave-nkf

diff scripts/specfun/primes.m @ 9141:c1fff751b5a8

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Update section 17.1 (Utility Functions) of arith.txi Split section into "Exponents and Logarithms" and "Utility Functions" Use Tex in many more of the doc strings for pretty printing in pdf format.
author Rik <rdrider0-list@yahoo.com>
date Mon, 20 Apr 2009 17:16:09 -0700
parents eb63fbe60fab
children 8c71a86c4bf4
line wrap: on
line diff
--- a/scripts/specfun/primes.m
+++ b/scripts/specfun/primes.m
@@ -21,12 +21,12 @@
 ##
 ## Return all primes up to @var{n}.  
 ##
+## The algorithm used is the Sieve of Erastothenes.
+##
 ## Note that if you need a specific number of primes, you can use the
 ## fact the distance from one prime to the next is on average
 ## proportional to the logarithm of the prime.  Integrating, you find
 ## that there are about @math{k} primes less than @math{k \log (5 k)}.
-##
-## The algorithm used is called the Sieve of Erastothenes.
 ## @end deftypefn
 
 ## Author: Paul Kienzle