Search Results for ""

The largest cube dividing a positive integer n. For n=1, 2, ..., the first few are 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, ... (OEIS A008834).

Draw the perpendicular line from the intersection of the two small semicircles in the arbelos. The two circles C_1 and C_2 tangent to this line, the large semicircle, and ...

The nth order Bernstein expansion of a function f(x) in terms of a variable x is given by B_n(f,x)=sum_(j=0)^n(n; j)x^j(1-x)^(n-j)f(j/n), (1) (Gzyl and Palacios 1997, Mathé ...

Relates invariants of a curve defined over the integers. If this inequality were proven true, then Fermat's last theorem would follow for sufficiently large exponents. ...

Define E(x;q,a)=psi(x;q,a)-x/(phi(q)), (1) where psi(x;q,a)=sum_(n<=x; n=a (mod q))Lambda(n) (2) (Davenport 1980, p. 121), Lambda(n) is the Mangoldt function, and phi(q) is ...

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

A 1-cusped epicycloid has b=a, so n=1. The radius measured from the center of the large circle for a 1-cusped epicycloid is given by epicycloid equation (◇) with n=1 so r^2 = ...

Every graph with n vertices and maximum vertex degree Delta(G)<=k is (k+1)-colorable with all color classes of size |_n/(k+1)_| or [n/(k+1)], where |_x_| is the floor ...

A Fourier series in which there are large gaps between nonzero terms a_n or b_n.

An algorithm for computing the eigenvalues and eigenvectors for large symmetric sparse matrices.