Search Results for ""

Find the maximum number of bishops B(n) that can be placed on an n×n chessboard such that no two attack each other. The answer is 2n-2 (Dudeney 1970, Madachy 1979), giving ...

In general, an extremal graph is the largest graph of order n which does not contain a given graph G as a subgraph (Skiena 1990, p. 143). Turán studied extremal graphs that ...

The (upper) matching number nu(G) of graph G, sometimes known as the edge independence number, is the size of a maximum independent edge set. Equivalently, it is the degree ...

A merge sort (or collation sort) is the combination of two or more ordered lists into a single ordered list (Knuth 1998, p. 158). Merge sorting was one of the first methods ...

One or both of the square bracket symbols [ and ] are used in many different contexts in mathematics. 1. Square brackets are occasionally used in especially complex ...

The centroid is center of mass of a two-dimensional planar lamina or a three-dimensional solid. The mass of a lamina with surface density function sigma(x,y) is ...

Debye's asymptotic representation is an asymptotic expansion for a Hankel function of the first kind with nu approx x. For 1-nu/x>epsilon, nu/x=sinalpha, ...

If f(x) is an even function, then b_n=0 and the Fourier series collapses to f(x)=1/2a_0+sum_(n=1)^inftya_ncos(nx), (1) where a_0 = 1/piint_(-pi)^pif(x)dx (2) = ...

A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...

Let t(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Then if S_m=sum_(t(m))1/t, (1) then {S_m=0 (mod m^2) ...