Search Results for ""
541 - 550 of 1130 for Combinatorial FormulasSearch Results
A sequent is an expression Gamma|-Lambda, where Gamma and Lambda are (possibly empty) sequences of formulas. Here, Gamma is called the antecedent and Lambda is called the ...
The spherical Bessel function of the first kind, denoted j_nu(z), is defined by j_nu(z)=sqrt(pi/(2z))J_(nu+1/2)(z), (1) where J_nu(z) is a Bessel function of the first kind ...
A map projection obtained by projecting points P on the surface of sphere from the sphere's north pole N to point P^' in a plane tangent to the south pole S (Coxeter 1969, p. ...
Rather surprisingly, trigonometric functions of npi/17 for n an integer can be expressed in terms of sums, products, and finite root extractions because 17 is a Fermat prime. ...
The Whittaker functions arise as solutions to the Whittaker differential equation. The linearly independent solutions to this equation are M_(k,m)(z) = ...
The associated Stirling numbers of the first kind d_2(n,k)=d(n,k) are defined as the number of permutations of a given number n having exactly k permutation cycles, all of ...
Suppose A and B are candidates for office and there are 2n voters, n voting for A and n for B. In how many ways can the ballots be counted so that B is never ahead of A? The ...
There are two kinds of Bell polynomials. A Bell polynomial B_n(x), also called an exponential polynomial and denoted phi_n(x) (Bell 1934, Roman 1984, pp. 63-67) is a ...
1 1 2 2 3 5 5 7 10 15 15 20 27 37 52 The Bell triangle, also called Aitken's array or the Peirce triangle (Knuth 2005, p. 28), is the number triangle obtained by beginning ...
An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...
...
View search results from all Wolfram sites (56183 matches)

