Search Results for ""

A tag system is set of rules that specifies a fixed number of elements (commonly denoted nu or beta) be removed from the beginning of a sequence and a set of elements to be ...

Thâbit ibn Kurrah's rules is a beautiful result of Thâbit ibn Kurrah dating back to the tenth century (Woepcke 1852; Escott 1946; Dickson 2005, pp. 5 and 39; Borho 1972). ...

The problem of finding the mean triangle area of a triangle with vertices picked inside a triangle with unit area was proposed by Watson (1865) and solved by Sylvester. It ...

The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].

The Wiener-Hopf method is a powerful technique which enables certain linear partial differential equations subject to boundary conditions on semi-infinite domains to be ...

Iff p is a prime, then (p-1)!+1 is a multiple of p, that is (p-1)!=-1 (mod p). (1) This theorem was proposed by John Wilson and published by Waring (1770), although it was ...

The Young tableau (plural, "tableaux") of a Ferrers diagram is obtained by placing the numbers 1, ..., n in the n boxes of the diagram. A "standard" Young tableau is a Young ...

A complete graph is a graph in which each pair of graph vertices is connected by an edge. The complete graph with n graph vertices is denoted K_n and has (n; 2)=n(n-1)/2 (the ...

An ellipse is a curve that is the locus of all points in the plane the sum of whose distances r_1 and r_2 from two fixed points F_1 and F_2 (the foci) separated by a distance ...

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...