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

A line segment connecting nonadjacent polyhedron vertices sharing a common face in a parallelepiped or other similar solid.

A game which is not biased toward any player. A game in which a given player can always win by playing correctly is therefore called an unfair game.

Since |(a+ib)(c+id)| = |a+ib||c+di| (1) |(ac-bd)+i(bc+ad)| = sqrt(a^2+b^2)sqrt(c^2+d^2), (2) it follows that (a^2+b^2)(c^2+d^2) = (ac-bd)^2+(bc+ad)^2 (3) = e^2+f^2. (4) This ...

Numbered rods which can be used to perform multiplication.

Let alpha_(n+1) = (2alpha_nbeta_n)/(alpha_n+beta_n) (1) beta_(n+1) = sqrt(alpha_nbeta_n), (2) then H(alpha_0,beta_0)=lim_(n->infty)a_n=1/(M(alpha_0^(-1),beta_0^(-1))), (3) ...

Harmonic coordinates satisfy the condition Gamma^lambda=g^(munu)Gamma_(munu)^lambda=0, (1) or equivalently, partial/(partialx^kappa)(sqrt(g)g^(lambdakappa))=0. (2) It is ...

A function which satisfies f(tx,ty)=t^nf(x,y) for a fixed n. Means, the Weierstrass elliptic function, and triangle center functions are homogeneous functions. A ...

The dilogarithm identity Li_2(-x)=-Li_2(x/(1+x))-1/2[ln(1+x)]^2.

The Lebesgue identity is the algebraic identity (Nagell 1951, pp. 194-195).