Search Results for ""

A (p,q)-graph is edge-graceful if the edges can be labeled 1 through q in such a way that the labels induced on the vertices by summing over incident edges modulo p are ...

A curve on the unit sphere S^2 is an eversion if it has no corners or cusps (but it may be self-intersecting). These properties are guaranteed by requiring that the curve's ...

The Fischer groups are the three sporadic groups Fi_(22), Fi_(23), and Fi_(24)^'. These groups were discovered during the investigation of 3-transposition groups. The Fischer ...

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...

Consider an n-digit number k. Square it and add the right n digits to the left n or n-1 digits. If the resultant sum is k, then k is called a Kaprekar number. For example, 9 ...

The Landau-Mignotte bound, also known as the Mignotte bound, is used in univariate polynomial factorization to determine the number of Hensel lifting steps needed. It gives ...

A polygonal number of the form N_n=n(7n-5)/2, also called an enneagonal number. The first few are 1, 9, 24, 46, 75, 111, 154, 204, ... (OEIS A001106). The generating function ...

A sentential formula that contains at least one free variable (Carnap 1958, p. 24). A sentential variable containing no free variables (i.e., all variables are bound) is ...

The numbers of positive definite n×n matrices of given types are summarized in the following table. For example, the three positive eigenvalues 2×2 (0,1)-matrices are [1 0; 0 ...

Hardy and Littlewood (1914) proved that the sequence {frac(x^n)}, where frac(x) is the fractional part, is equidistributed for almost all real numbers x>1 (i.e., the ...