Search Results for ""

A moving average using 15 points having weights -3, -6, -5, 3, 21, 46, 67, 74, 67, 46, 21, 3, -5, -6, and -3. It is sometimes used by actuaries.

A spigot algorithm is an algorithm which generates digits of a quantity one at a time without using or requiring previously computed digits. Amazingly, spigot algorithms are ...

The quantifier "for all" ( forall ), sometimes also known as the "general quantifier."

v=(dr)/(dt), (1) where r is the radius vector and d/dt is the derivative with respect to time. Expressed in terms of the arc length, v=(ds)/(dt)T^^, (2) where T^^ is the unit ...

Let alpha, -beta, and -gamma^(-1) be the roots of the cubic equation t^3+2t^2-t-1=0, (1) then the Rogers L-function satisfies L(alpha)-L(alpha^2) = 1/7 (2) ...

If there is a (nu,nu^') correspondence between two curves of curve genus p and p^' and the number of branch points properly counted are beta and beta^', then ...

The Cameron graph is a strongly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(231,30,9,3). It is distance-regular with intersection array ...

The Conway-Smith graph is a distance-transitive graph on 63 vertices having intersection array {10,6,4,1;1,2,6,10} (Hall 1980). It is also distance-transitive. It is denoted ...

The Doob graph D(m,n) is the graph given by the graph Cartesian product of m>=1 copies of the Shrikhande graph with a Hamming graph H(n,4). Doob graphs are distance-regular ...

A curve also known as the Gerono lemniscate. It is given by Cartesian coordinates x^4=a^2(x^2-y^2), (1) polar coordinates, r^2=a^2sec^4thetacos(2theta), (2) and parametric ...