Search Results for ""

The four-color theorem states that any map in a plane can be colored using four-colors in such a way that regions sharing a common boundary (other than a single point) do not ...

The Fourier transform is a generalization of the complex Fourier series in the limit as L->infty. Replace the discrete A_n with the continuous F(k)dk while letting n/L->k. ...

The greatest common divisor, sometimes also called the highest common divisor (Hardy and Wright 1979, p. 20), of two positive integers a and b is the largest divisor common ...

The Hermite polynomials H_n(x) are set of orthogonal polynomials over the domain (-infty,infty) with weighting function e^(-x^2), illustrated above for n=1, 2, 3, and 4. ...

The Jacobi elliptic functions are standard forms of elliptic functions. The three basic functions are denoted cn(u,k), dn(u,k), and sn(u,k), where k is known as the elliptic ...

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

An n×n Latin square is a Latin rectangle with k=n. Specifically, a Latin square consists of n sets of the numbers 1 to n arranged in such a way that no orthogonal (row or ...

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...

The Möbius function is a number theoretic function defined by mu(n)={0 if n has one or more repeated prime factors; 1 if n=1; (-1)^k if n is a product of k distinct primes, ...