Search Results for ""

Rule 30 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

Let b(k) be the number of 1s in the binary expression of k, i.e., the binary digit count of 1, giving 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, ... (OEIS A000120) for k=1, 2, .... ...

A regular graph that is not strongly regular is known as a weakly regular graph. There are no weakly regular simple graphs on fewer than six nodes, and the numbers on n=6, 7, ...

Zarankiewicz's conjecture asserts that graph crossing number for a complete bipartite graph K_(m,n) is Z(m,n)=|_n/2_||_(n-1)/2_||_m/2_||_(m-1)/2_|, (1) where |_x_| is the ...

A Fourier series is an expansion of a periodic function f(x) in terms of an infinite sum of sines and cosines. Fourier series make use of the orthogonality relationships of ...

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...

An irrational number is a number that cannot be expressed as a fraction p/q for any integers p and q. Irrational numbers have decimal expansions that neither terminate nor ...

Newton's method, also called the Newton-Raphson method, is a root-finding algorithm that uses the first few terms of the Taylor series of a function f(x) in the vicinity of a ...

Riemann defined the function f(x) by f(x) = sum_(p^(nu)<=x; p prime)1/nu (1) = sum_(n=1)^(|_lgx_|)(pi(x^(1/n)))/n (2) = pi(x)+1/2pi(x^(1/2))+1/3pi(x^(1/3))+... (3) (Hardy ...

The Rogers-Ramanujan continued fraction is a generalized continued fraction defined by R(q)=(q^(1/5))/(1+q/(1+(q^2)/(1+(q^3)/(1+...)))) (1) (Rogers 1894, Ramanujan 1957, ...