Search Results for ""

The number of ways in which a group of n with weights sum_(i=1)^(n)w_i=1 can change a losing coalition (one with sumw_i<1/2) to a winning one, or vice versa. It was proposed ...

The nth order Bernstein expansion of a function f(x) in terms of a variable x is given by B_n(f,x)=sum_(j=0)^n(n; j)x^j(1-x)^(n-j)f(j/n), (1) (Gzyl and Palacios 1997, Mathé ...

Let phi(t)=sum_(n=0)^(infty)A_nt^n be any function for which the integral I(x)=int_0^inftye^(-tx)t^pphi(t)dt converges. Then the expansion where Gamma(z) is the gamma ...

There are two identities known as Catalan's identity. The first is F_n^2-F_(n+r)F_(n-r)=(-1)^(n-r)F_r^2, where F_n is a Fibonacci number. Letting r=1 gives Cassini's ...

Let t be a nonnegative integer and let x_1, ..., x_t be nonzero elements of Z_p which are not necessarily distinct. Then the number of elements of Z_p that can be written as ...

sum_(k=0)^m(phi_k(x)phi_k(y))/(gamma_k)=(phi_(m+1)(x)phi_m(y)-phi_m(x)phi_(m+1)(y))/(a_mgamma_m(x-y),) (1) where phi_k(x) are orthogonal polynomials with weighting function ...

Let the absolute frequencies of occurrence of an event in a number of class intervals be denoted f_1, f_2, .... The cumulative frequency corresponding to the upper boundary ...

A number n is said to be divisible by d if d is a divisor of n. The function Divisible[n, d] returns True if an integer n is divisible by an integer d. The product of any n ...

To enumerate a set of objects satisfying some set of properties means to explicitly produce a listing of all such objects. The problem of determining or counting all such ...

There exists an absolute constant C such that for any positive integer m, the discrepancy of any sequence {alpha_n} satisfies ...