get.primes

Provides a vector of a specified number of smallest primes from the
 internal table of the package.

Provides (1) pseudo random generators - general linear congruential generators,
multiple recursive generators and generalized feedback shift register (SF-Mersenne Twister
algorithm and WELL generators); (2) quasi random generators - the Torus algorithm, the
Sobol sequence, the Halton sequence (including the Van der Corput sequence) and (3) some
generator tests - the gap test, the serial test, the poker test.
See e.g. Gentle (2003) <doi:10.1007/b97336>. The package can be provided
without the rngWELL dependency on demand.
Take a look at the Distribution task view of types and tests of random number generators.
Package in Memoriam of Diethelm and Barbara Wuertz.

Christophe Dutang

randtoolbox

Toolbox for Pseudo and Quasi Random Number Generation and Random
Generator Tests

get.primes function

<dl> <dt>n</dt>
<dd>The required number of primes. Should be at most 100 000.</dd></dl>

Arguments

Get primes for quasi random number generation — get.primes

<dl>

 <dt>n</dt>
<dd>The required number of primes. Should be at most 100 000.</dd>

</dl>

get.primes: Get primes for quasi random number generation

Description

Usage

Value

Arguments

Details

See Also

Examples