Search Results for ""

In his monumental treatise Disquisitiones Arithmeticae, Gauss conjectured that the class number h(-d) of an imaginary quadratic field with binary quadratic form discriminant ...

Let the difference of successive primes be defined by d_n=p_(n+1)-p_n, and d_n^k by d_n^k={d_n for k=1; |d_(n+1)^(k-1)-d_n^(k-1)| for k>1. (1) N. L. Gilbreath claimed that ...

The Goddard-Henning graph, illustrated above in several embeddings, is the 9-node planar graph of graph diameter 2 having domination number gamma=3. It was first constructed ...

Consider the recurrence relation x_n=(1+x_0^2+x_1^2+...+x_(n-1)^2)/n, (1) with x_0=1. The first few iterates of x_n are 1, 2, 3, 5, 10, 28, 154, ... (OEIS A003504). The terms ...

An important result in valuation theory which gives information on finding roots of polynomials. Hensel's lemma is formally stated as follows. Let (K,|·|) be a complete ...

A Hilbert space is a vector space H with an inner product <f,g> such that the norm defined by |f|=sqrt(<f,f>) turns H into a complete metric space. If the metric defined by ...

A number n is called k-hyperperfect if n = 1+ksum_(i)d_i (1) = 1+k[sigma(n)-n-1], (2) where sigma(n) is the divisor function and the summation is over the proper divisors ...

An imperfect graph G is a graph that is not perfect. Therefore, graphs G with omega(G)<chi(G) (1) where omega(G) is the clique number and chi(G) is the chromatic number are ...

Laguerre-Gauss quadrature, also called Gauss-Laguerre quadrature or Laguerre quadrature, is a Gaussian quadrature over the interval [0,infty) with weighting function ...

A root-finding algorithm which converges to a complex root from any starting position. To motivate the formula, consider an nth order polynomial and its derivatives, P_n(x) = ...