Search Results for ""

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) = ...

Arrange copies of the n digits 1, ..., n such that there is one digit between the 1s, two digits between the 2s, etc. For example, the unique (modulo reversal) n=3 solution ...

A polygon whose vertices are points of a point lattice. Regular lattice n-gons exists only for n=3, 4, and 6 (Schoenberg 1937, Klamkin and Chrestenson 1963, Maehara 1993). A ...

Legendre's conjecture asserts that for every n there exists a prime p between n^2 and (n+1)^2 (Hardy and Wright 1979, p. 415; Ribenboim 1996, pp. 397-398). It is one of ...

The Lehmer cotangent expansion for which the convergence is slowest occurs when the inequality in the recurrence equation b_k>=b_(k-1)^2+b_(k-1)+1. (1) for ...

Lehmer's totient problem asks if there exist any composite numbers n such that phi(n)|(n-1), where phi(n) is the totient function? No such numbers are known. However, any ...

Let (P,B) denote a configuration with v points P={p_1,...,p_v} and b lines ("blocks") B=(B_1,...,B_b). Then the Levi graph L(P,B), also called the incidence graph, of a ...

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 ...

Let L=(L, ^ , v ) be a lattice, and let f,g:L->L. Then the pair (f,g) is a local polarity if and only if for each finite set X subset= L, there is a finitely generated ...