Search Results for ""

Let a prime number generated by Euler's prime-generating polynomial n^2+n+41 be known as an Euler prime. (Note that such primes are distinct from prime Euler numbers, which ...

A square array made by combining n objects of two types such that the first and second elements form Latin squares. Euler squares are also known as Graeco-Latin squares, ...

Let O and I be the circumcenter and incenter of a triangle with circumradius R and inradius r. Let d be the distance between O and I. Then d^2=R(R-2r) (Mackay 1886-1887; ...

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 continued fraction is the name given by Borwein et al. (2004, p. 30) to Euler's formula for the inverse tangent, ...

The system of partial differential equations describing fluid flow in the absence of viscosity, given by (partialu)/(partialt)+u·del u=-(del P)/rho, where u is the fluid ...

_2F_1(a,b;c;z)=int_0^1(t^(b-1)(1-t)^(c-b-1))/((1-tz)^a)dt, (1) where _2F_1(a,b;c;z) is a hypergeometric function. The solution can be written using the Euler's ...

The Euler triangle formula states that the distance d between the incenter and circumcenter of a triangle is given by d^2=R(R-2r), where R is the circumradius and r is the ...

The Machin-like formula 1/4pi=cot^(-1)(2)+cot^(-1)(3). The other 2-term Machin-like formulas are Hermann's formula, hutton's formula, and Machin's formula.

The triangle of numbers A_(n,k) given by A_(n,1)=A_(n,n)=1 (1) and the recurrence relation A_(n+1,k)=kA_(n,k)+(n+2-k)A_(n,k-1) (2) for k in [2,n], where A_(n,k) are shifted ...