Search Results for ""

A lattice graph, also known as a mesh graph or grid graph, is a graph possessing an embedding in a Euclidean space R^n that forms a regular tiling. Examples include grid ...

The term "left factorial" is sometimes used to refer to the subfactorial !n, the first few values for n=1, 2, ... are 1, 3, 9, 33, 153, 873, 5913, ... (OEIS A007489). ...

Let p(d,a) be the smallest prime in the arithmetic progression {a+kd} for k an integer >0. Let p(d)=maxp(d,a) such that 1<=a<d and (a,d)=1. Then there exists a d_0>=2 and an ...

A lobster graph, lobster tree, or simply "lobster," is a tree having the property that the removal of leaf nodes leaves a caterpillar graph (Gallian 2007). The numbers of ...

The continuous distribution with parameters m and b>0 having probability and distribution functions P(x) = (e^(-(x-m)/b))/(b[1+e^(-(x-m)/b)]^2) (1) D(x) = 1/(1+e^(-(x-m)/b)) ...

A lozenge (or rhombus) algorithm is a class of transformation that can be used to attempt to produce series convergence improvement (Hamming 1986, p. 207). The best-known ...

1000 The medial triambic icosahedron is the dual of the ditrigonal dodecadodecahedron U_(41) and Wenninger dual W_(80), whose outward appearance is the same as the great ...

The second theorem of Mertens states that the asymptotic form of the harmonic series for the sum of reciprocal primes is given by sum_(p<=x)1/p=lnlnx+B_1+o(1), where p is a ...

Midpoint augmentation, a term introduced here, is a variant of conventional augmentation in which each facial polygon is replaced by a triangular polygon joining vertices ...

Let a module M in an integral domain D_1 for R(sqrt(D)) be expressed using a two-element basis as M=[xi_1,xi_2], where xi_1 and xi_2 are in D_1. Then the different of the ...