sieve_primes: Find all primes up to a given positive integer
In torfason/zulutils: Miscellaneous utility functions that the author found useful
sieve_primes R Documentation
Find all primes up to a given positive integer
Description
This function implements the Sieve of Eratosthenes algorithm to find all
prime numbers up to the given positive integer n. It returns a vector of
integers representing the prime numbers.
Usage
sieve_primes(n)
Arguments
n
A positive integer specifying the upper limit for the prime numbers.
Value
A numeric vector of prime numbers up to n.
Examples
zulutils:::sieve_primes(10)
zulutils:::sieve_primes(20)
torfason/zulutils documentation built on Aug. 21, 2023, 5:46 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| sieve_primes | R Documentation |
Find all primes up to a given positive integer
Description
This function implements the Sieve of Eratosthenes algorithm to find all
prime numbers up to the given positive integer n. It returns a vector of
integers representing the prime numbers.
Usage
sieve_primes(n)
Arguments
n |
A positive integer specifying the upper limit for the prime numbers. |
Value
A numeric vector of prime numbers up to n.
Examples
zulutils:::sieve_primes(10)
zulutils:::sieve_primes(20)
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.