Generate a list of prime numbers.
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
large. A prime number is one that has no other factors other than
Returns numeric vector containing prime numbers less than or equal to
1 2 3 4 5 6 7