Search Results for ""

A usually simple algorithm or identity. The term is frequently applied to specific orders of Newton-Cotes formulas. The designation "rule n" is also given to the nth ...

Let the sum of squares function r_k(n) denote the number of representations of n by k squares, then the summatory function of r_2(k)/k has the asymptotic expansion ...

The conjecture that all integers >1 occur as a value of the totient valence function (i.e., all integers >1 occur as multiplicities). The conjecture was proved by Ford ...

Gaussian elimination is a method for solving matrix equations of the form Ax=b. (1) To perform Gaussian elimination starting with the system of equations [a_(11) a_(12) ... ...

The modular equation of degree five can be written (u/v)^3+(v/u)^3=2(u^2v^2-1/(u^2v^2)).

Linear programming, sometimes known as linear optimization, is the problem of maximizing or minimizing a linear function over a convex polyhedron specified by linear and ...

The circumcenter is the center O of a triangle's circumcircle. It can be found as the intersection of the perpendicular bisectors. The trilinear coordinates of the ...

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

Given a triangle DeltaABC, the triangle DeltaH_AH_BH_C whose vertices are endpoints of the altitudes from each of the vertices of DeltaABC is called the orthic triangle, or ...

The summatory function Phi(n) of the totient function phi(n) is defined by Phi(n) = sum_(k=1)^(n)phi(k) (1) = sum_(m=1)^(n)msum_(d|m)(mu(d))/d (2) = ...