Search Results for ""

Let there be n ways for a "good" selection and m ways for a "bad" selection out of a total of n+m possibilities. Take N samples and let x_i equal 1 if selection i is ...

A function which has infinitely many derivatives at a point. If a function is not polygenic, it is monogenic.

The plots above show the values of the function obtained by taking the natural logarithm of the gamma function, lnGamma(z). Note that this introduces complicated branch cut ...

A function built up of a finite combination of constant functions, field operations (addition, multiplication, division, and root extractions--the elementary operations)--and ...

Let N samples be taken from a population with central moments mu_n. The sample variance m_2 is then given by m_2=1/Nsum_(i=1)^N(x_i-m)^2, (1) where m=x^_ is the sample mean. ...

Fischer's z-distribution is the general distribution defined by g(z)=(2n_1^(n_1/2)n_2^(n_2/2))/(B((n_1)/2,(n_2)/2))(e^(n_1z))/((n_1e^(2z)+n_2)^((n_1+n_2)/2)) (1) (Kenney and ...

Let S_n be the set of permutations of {1, 2, ..., n}, and let sigma_t be the continuous time random walk on S_n that results when randomly chosen transpositions are performed ...

F_k[P_N(k)](x)=F_k[exp(-N|k|^beta)](x), where F is the Fourier transform of the probability P_N(k) for N-step addition of random variables. Lévy showed that beta in (0,2) for ...

The floor function |_x_|, also called the greatest integer function or integer value (Spanier and Oldham 1987), gives the largest integer less than or equal to x. The name ...

A function f:A->B such that B is a set of numbers.