Search Results for ""

The Kittell graph is a planar graph on 23 nodes and 63 edges that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof of ...

An algorithm which extrapolates the partial sums s_n of a series sum_(n)a_n whose convergence is approximately geometric and accelerates its rate of convergence. The ...

The study of the geometry of figures by algebraic representation and manipulation of equations describing their positions, configurations, and separations. Analytic geometry ...

The Benney equation in 1+1 dimensions is the nonlinear partial differential equation ...

For a fractal process with values y(t-Deltat) and y(t+Deltat), the correlation between these two values is given by the Brown function r=2^(2H-1)-1, also known as the ...

f(x)=C_psiint_(-infty)^inftyint_(-infty)^infty<f,psi^(a,b)>psi^(a,b)(x)a^(-2)dadb, where psi^(a,b)(x)=|a|^(-1/2)psi((x-b)/a). This result was originally derived using ...

There are two identities known as Catalan's identity. The first is F_n^2-F_(n+r)F_(n-r)=(-1)^(n-r)F_r^2, where F_n is a Fibonacci number. Letting r=1 gives Cassini's ...

Given any real number theta and any positive integer N, there exist integers h and k with 0<k<=N such that |ktheta-h|<1/N. A slightly weaker form of the theorem states that ...

136·2^(256) approx 1.575×10^(79). According to Eddington, the exact number of protons in the universe, where 136 was the reciprocal of the fine structure constant as best as ...

An Euler pseudoprime to the base b is a composite number n which satisfies b^((n-1)/2)=+/-1 (mod n). The first few base-2 Euler pseudoprimes are 341, 561, 1105, 1729, 1905, ...