Search Results for ""

An Eulerian graph is a graph containing an Eulerian cycle. The numbers of Eulerian graphs with n=1, 2, ... nodes are 1, 1, 2, 3, 7, 15, 52, 236, ... (OEIS A133736), the first ...

Legendre and Whittaker and Watson's (1990) term for the beta integral int_0^1x^p(1-x)^qdx, whose solution is the beta function B(p+1,q+1).

For R[n]>-1 and R[z]>0, Pi(z,n) = n^zint_0^1(1-x)^nx^(z-1)dx (1) = (n!)/((z)_(n+1))n^z (2) = B(z,n+1), (3) where (z)_n is the Pochhammer symbol and B(p,q) is the beta ...

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 ...

An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...

Euler's 6n+1 theorem states that every prime of the form 6n+1, (i.e., 7, 13, 19, 31, 37, 43, 61, 67, ..., which are also the primes of the form 3n+1; OEIS A002476) can be ...

Let g(x)=(1-x^2)(1-k^2x^2). Then int_0^a(dx)/(sqrt(g(x)))+int_0^b(dx)/(sqrt(g(x)))=int_0^c(dx)/(sqrt(g(x))), where c=(bsqrt(g(a))+asqrt(g(b)))/(sqrt(1-k^2a^2b^2)).

Define g(k) as the quantity appearing in Waring's problem, then Euler conjectured that g(k)=2^k+|_(3/2)^k_|-2, where |_x_| is the floor function.

Euler's continued fraction is the name given by Borwein et al. (2004, p. 30) to Euler's formula for the inverse tangent, ...

For p an odd prime and a positive integer a which is not a multiple of p, a^((p-1)/2)=(a/p) (mod p), where (a|p) is the Legendre symbol.