Search Results for ""

The Erdős-Selfridge function g(k) is defined as the least integer bigger than k+1 such that the least prime factor of (g(k); k) exceeds k, where (n; k) is the binomial ...

The fibonomial coefficient (sometimes also called simply the Fibonacci coefficient) is defined by [m; k]_F=(F_mF_(m-1)...F_(m-k+1))/(F_1F_2...F_k), (1) where [m; 0]_F=1 and ...

A correction to a discrete binomial distribution to approximate a continuous distribution. P(a<=X<=b) approx P((a-1/2-np)/(sqrt(np(1-p)))<=z<=(b+1/2-np)/(sqrt(np(1-p)))), ...

A multinomial series is generalization of the binomial series discovered by Johann Bernoulli and Leibniz. The multinomial series arises in a generalization of the binomial ...

Let n>1 be any integer and let lpf(n) (also denoted LD(n)) be the least integer greater than 1 that divides n, i.e., the number p_1 in the factorization ...

Schmidt (1993) proposed the problem of determining if for any integer r>=2, the sequence of numbers {c_k^((r))}_(k=1)^infty defined by the binomial sums sum_(k=0)^n(n; ...

A number is said to be squarefree (or sometimes quadratfrei; Shanks 1993) if its prime decomposition contains no repeated factors. All primes are therefore trivially ...

For a bivariate normal distribution, the distribution of correlation coefficients is given by P(r) = (1) = (2) = (3) where rho is the population correlation coefficient, ...

Let L=<L, v , ^ > and K=<K, v , ^ > be lattices, and let h:L->K. Then h is a lattice homomorphism if and only if for any a,b in L, h(a v b)=h(a) v h(b) and h(a ^ b)=h(a) ^ ...

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...