Find all prime numbers aka ‘primes’ less than \(n\).
Uses an obvious sieve method and some care, working with logical and integers to be quite fast.
Primes(n)
a (typically positive integer) number.
numeric vector of all prime numbers \(\le n\).
As the function only uses max(n), n can also be a vector of numbers.
max(n)
n
Factorize, GCD, LCM, IsPrime
Factorize
GCD
LCM
IsPrime
# NOT RUN { (p1 <- Primes(100)) system.time(p1k <- Primes(1000)) # still lightning .. stopifnot(length(p1k) == 168) # }
Run the code above in your browser using DataCamp Workspace