primes | R Documentation |
Generate a list of prime numbers.
primes(n)
n |
scalar numeric specifying largest prime number desired. |
Generates the list of prime numbers less than or equal to n
using a
variant of the basic "Sieve of Eratosthenes" algorithm. This approach is
reasonably fast, but requires a copious amount of memory when n
is
large. A prime number is one that has no other factors other than 1
and itself.
Returns numeric vector containing prime numbers less than or equal to
argument n
.
H. Borchers hwborchers@googlemail.com, P. Roebuck proebuck1701@gmail.com
isprime
,
factors
primes(1000)
length(primes(1e6)) # 78498 prime numbers less than one million
## Not run:
length(primes(1e7)) # 664579 prime numbers less than ten million
length(primes(1e8)) # 5761455 prime numbers less than one hundred million
## End(Not run)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.