Search Results for ""

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

The inverse tangent is the multivalued function tan^(-1)z (Zwillinger 1995, p. 465), also denoted arctanz (Abramowitz and Stegun 1972, p. 79; Harris and Stocker 1998, p. 311; ...

Let x be a real number, and let R be the set of positive real numbers mu for which 0<|x-p/q|<1/(q^mu) (1) has (at most) finitely many solutions p/q for p and q integers. Then ...

Let x=[a_0;a_1,...]=a_0+1/(a_1+1/(a_2+1/(a_3+...))) (1) be the simple continued fraction of a "generic" real number x, where the numbers a_i are the partial denominator. ...

The Lambert W-function, also called the omega function, is the inverse function of f(W)=We^W. (1) The plot above shows the function along the real axis. The principal value ...

Minimal surfaces are defined as surfaces with zero mean curvature. A minimal surface parametrized as x=(u,v,h(u,v)) therefore satisfies Lagrange's equation, ...

Unlike quadratic, cubic, and quartic polynomials, the general quintic cannot be solved algebraically in terms of a finite number of additions, subtractions, multiplications, ...

The sine function sinx is one of the basic functions encountered in trigonometry (the others being the cosecant, cosine, cotangent, secant, and tangent). Let theta be an ...

A space-filling polyhedron is a polyhedron which can be used to generate a tessellation of space. Although even Aristotle himself proclaimed in his work On the Heavens that ...