Search Results for ""

A theorem, also called the iteration theorem, that makes use of the lambda notation introduced by Church. Let phi_x^((k)) denote the recursive function of k variables with ...

Knuth's series is given by S = sum_(k=1)^(infty)((k^k)/(k!e^k)-1/(sqrt(2pik))) (1) = -2/3-1/(sqrt(2pi))zeta(1/2) (2) = -0.08406950872765599646... (3) (OEIS A096616), where ...

The Lorenz asymmetry coefficient is a summary statistic of the Lorenz curve that measures the degree of asymmetry of a Lorenz curve. The Lorenz asymmetry coefficient is ...

A modification of Legendre's formula for the prime counting function pi(x). It starts with |_x_| = (1) where |_x_| is the floor function, P_2(x,a) is the number of integers ...

The equation x_1^2+x_2^2+...+x_n^2-2x_0x_infty=0 represents an n-dimensional hypersphere S^n as a quadratic hypersurface in an (n+1)-dimensional real projective space ...

The positive integers are the numbers 1, 2, 3, ... (OEIS A000027), sometimes called the counting numbers or natural numbers, denoted Z^+. They are the solution to the simple ...

A qubit (or quantum bit) is the analog of a bit for quantum computation. Unlike an ordinary bit, which may only assume two possible values (usually called 0 and 1), a qubit ...

A formula also known as the Legendre addition theorem which is derived by finding Green's functions for the spherical harmonic expansion and equating them to the generating ...

A spider graph, spider tree, or simply "spider," is a tree with one vertex of degree at least 3 and all others with degree at most 2. The numbers of spiders on n=1, 2, ... ...

The gonality (also called divisorial gonality) gon(G) of a (finite) graph G is the minimum degree of a rank 1 divisor on that graph. It can be thought of as the minimum ...