28/1/2017

R/SieveofEratosthenes.mdatmasterJoseMirelesQ/R

Sieve of Eratosthenes
Finding all prime numbers up toausing the Sieve of Eratosthenes:
a<1000000
primesfn<function(sieve,set){
p<set[1]
n<set[length(set)]
if(p^2>n)
return(c(sieve,set))
else{
set<set[set%%p!=0]
sieve<c(sieve,p)
return(primesfn(sieve,set))
}
}
primes<primesfn(c(),2:a)

How many prime numbers are less thana?

length(primes)
#[1]78498

Letx<a, isxa prime number?

x<999931
is.element(x,primes)
#[1]TRUE
x<1000
is.element(x,primes)
#[1]FALSE

What is thekthprime?
k<100
primes[k]
#[1]541

https://github.com/JoseMirelesQ/R/blob/master/SieveofEratosthenes.md

1/1