get.primes: Get primes for quasi random number generation
In quasiRNG: Toolbox for quasi random number generation.
Description
Usage
Arguments
Details
Value
See Also
Examples
Description
Provides a vector of a specified number of smallest primes from the
internal table of the package.
Usage
1
get.primes(n)
Arguments
n
The required number of primes. Should be at most 100 000.
Details
The package contains an internal table of the smallest 100 000 primes,
which may be used in torus algorithm.
Value
Vetor of min(n, 100000) smallest primes.
See Also
Examples
1
2
p <- get.primes(20)
torus(5,dim=10,prime=p[11:20])
quasiRNG documentation built on May 2, 2019, 4:30 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.
Description Usage Arguments Details Value See Also Examples
Description
Provides a vector of a specified number of smallest primes from the internal table of the package.
Usage
1 | get.primes(n)
|
Arguments
n |
The required number of primes. Should be at most 100 000. |
Details
The package contains an internal table of the smallest 100 000 primes,
which may be used in torus algorithm.
Value
Vetor of min(n, 100000) smallest primes.
See Also
Examples
1 2 | p <- get.primes(20)
torus(5,dim=10,prime=p[11: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.