|
From: Dr.-Ing. T. F. <fi...@ig...> - 2006-06-11 02:58:00
|
Dear Octave Developers attached you will find a tarball containing a few little functions to - calculate list of primes in given ranges - calculate number of primes up to given bound those functions are based on D. Bernsteins primegen library, that provides very fast O(N) functions. These functions calculate the list of primes up to 10,000,000 15 times faster than the well known octave-forge function primes(). The advantage grows with increasing bounds. Best regards Torsten Finke -- ------------------------------------------------------------------------ Dr.-Ing. Torsten Finke Ingenieurgemeinschaft IgH Heinz-Baecker-Str. 34 D-45356 Essen Tel.: +49 201 / 360-14-17 Fax.: +49 201 / 360-14-14 E-mail: tor...@ig... ------------------------------------------------------------------------ |