Search Results for ""

int_0^(pi/2)cos^nxdx = int_0^(pi/2)sin^nxdx (1) = (sqrt(pi)Gamma(1/2(n+1)))/(nGamma(1/2n)) (2) = ((n-1)!!)/(n!!){1/2pi for n=2, 4, ...; 1 for n=3, 5, ..., (3) where Gamma(n) ...

A q-analog of the beta function B(a,b) = int_0^1t^(a-1)(1-t)^(b-1)dt (1) = (Gamma(a)Gamma(b))/(Gamma(a+b)), (2) where Gamma(z) is a gamma function, is given by B_q(a,b) = ...

The function defined by [n]_q = [n; 1]_q (1) = (1-q^n)/(1-q) (2) for integer n, where [n; k]_q is a q-binomial coefficient. The q-bracket satisfies lim_(q->1^-)[n]_q=n. (3)

A q-analog of the multinomial coefficient, defined as ([a_1+...+a_n]_q!)/([a_1]_q!...[a_n]_q!), where [n]_q! is a q-factorial.

The Eulerian number <n; k> gives the number of permutations of {1,2,...,n} having k permutation ascents (Graham et al. 1994, p. 267). Note that a slightly different ...

Also called the ménage problem. In how many ways can n married couples be seated around a circular table in such a manner than there is always one man between two women and ...

There are several differing definitions of the sun graph. ISGCI defines a (complete) n-sun graph as a graph on 2n nodes (sometimes also known as a trampoline graph; ...

Primorial primes are primes of the form p_n#+/-1, where p_n# is the primorial of p_n. A coordinated search for such primes is being conducted on PrimeGrid. p_n#-1 is prime ...

The nth subfactorial (also called the derangement number; Goulden and Jackson 1983, p. 48; Graham et al. 2003, p. 1050) is the number of permutations of n objects in which no ...

The word "convergent" has a number of different meanings in mathematics. Most commonly, it is an adjective used to describe a convergent sequence or convergent series, where ...