Search Results for ""

Define the juggler sequence for a positive integer a_1=n as the sequence of numbers produced by the iteration a_(k+1)={|_a_k^(1/2)_| for even a_k; |_a_k^(3/2)_| for odd a_k, ...

Also called Radau quadrature (Chandrasekhar 1960). A Gaussian quadrature with weighting function W(x)=1 in which the endpoints of the interval [-1,1] are included in a total ...

Given a map with genus g>0, Heawood showed in 1890 that the maximum number N_u of colors necessary to color a map (the chromatic number) on an unbounded surface is N_u = ...

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

If a univariate real function f(x) has a single critical point and that point is a local maximum, then f(x) has its global maximum there (Wagon 1991, p. 87). The test breaks ...

Hadamard matrices H_n can be constructed using finite field GF(p^m) when p=4l-1 and m is odd. Pick a representation r relatively prime to p. Then by coloring white ...

Porter's constant is the constant appearing in formulas for the efficiency of the Euclidean algorithm, C = (6ln2)/(pi^2)[3ln2+4gamma-(24)/(pi^2)zeta^'(2)-2]-1/2 (1) = ...

Let G=(V,E) be a finite graph, let Omega be the set Omega={0,1}^E whose members are vectors omega=(omega(e):e in E), and let F be the sigma-algebra of all subsets of Omega. A ...

In the most commonly used convention (e.g., Apostol 1967, pp. 205-207), the second fundamental theorem of calculus, also termed "the fundamental theorem, part II" (e.g., ...

A solitary number is a number which does not have any friends. Solitary numbers include all primes, prime powers, and numbers for which (n,sigma(n))=1, where (a,b) is the ...