Search Results for ""

Let E_1(x) be the En-function with n=1, E_1(x) = int_1^infty(e^(-tx)dt)/t (1) = int_x^infty(e^(-u)du)/u. (2) Then define the exponential integral Ei(x) by E_1(x)=-Ei(-x), (3) ...

A field K is said to be an extension field (or field extension, or extension), denoted K/F, of a field F if F is a subfield of K. For example, the complex numbers are an ...

A Ferrers diagram represents partitions as patterns of dots, with the nth row having the same number of dots as the nth term in the partition. The spelling "Ferrars" (Skiena ...

Simply stated, floating-point algebra is algebra performed on floating-point representations by any number of automated devices. Traditionally, this definition is phrased so ...

Define the abundancy Sigma(n) of a positive integer n as Sigma(n)=(sigma(n))/n, (1) where sigma(n) is the divisor function. Then a pair of distinct numbers (k,m) is a ...

Gaussian curvature, sometimes also called total curvature (Kreyszig 1991, p. 131), is an intrinsic property of a space independent of the coordinate system used to describe ...

A generalized continued fraction is an expression of the form b_0+(a_1)/(b_1+(a_2)/(b_2+(a_3)/(b_3+...))), (1) where the partial numerators a_1,a_2,... and partial ...

Turing machines are defined by sets of rules that operate on four parameters: (state, tape cell color, operation, state). Let the states and tape cell colors be numbered and ...

Graham's biggest little hexagon is the largest possible (not necessarily regular) convex hexagon with polygon diameter 1 (i.e., for which no two of the vertices are more than ...

For an integer n>=2, let gpf(x) denote the greatest prime factor of n, i.e., the number p_k in the factorization n=p_1^(a_1)...p_k^(a_k), with p_i<p_j for i<j. For n=2, 3, ...