Latin Hypercube Samples (lhs)
1.0
R, C++, and Rcpp code to generate Latin hypercube samples
|
Functions | |
int | isprime_old (int p) |
int | isprime (unsigned int n) |
void | primepow (int q, int *p, int *n, int *isit) |
int | isprimepow (int q) |
int | ipow (int a, int b) |
Utilities related to prime numbers
int oacpp::primes::ipow | ( | int | a, |
int | b | ||
) |
pow() with integer arguments and value
a | |
b |
int oacpp::primes::isprime | ( | unsigned int | n | ) |
returns 1 for prime argument
n | number to test |
p
is prime int oacpp::primes::isprime_old | ( | int | p | ) |
Is the number prime
p | number |
int oacpp::primes::isprimepow | ( | int | q | ) |
returns 1 for prime power argument
q |
void oacpp::primes::primepow | ( | int | q, |
int * | p, | ||
int * | n, | ||
int * | isit | ||
) |
find q=p^n if q is a prime power with n>0
q | integer that is a prime power |
p | the prime base |
n | the integer power |
isit | an indicator of completion |