Search Results for ""

In general, the word "complement" refers to that subset F^' of some set S which excludes a given subset F. Taking F and its complement F^' together then gives the whole of ...

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

The cosecant cscz is the function defined by cscz = 1/(sinz) (1) = (2i)/(e^(iz)-e^(-iz)), (2) where sinz is the sine. The cosecant is implemented in the Wolfram Language as ...

An order-n Costas array is a permutation on {1,...,n} such that the distances in each row of the triangular difference table are distinct. For example, the permutation ...

The Dottie number is the name given by Kaplan (2007) to the unique real root of cosx=x (namely, the unique real fixed point of the cosine function), which is 0.739085... ...

Highly composite numbers are numbers such that divisor function d(n)=sigma_0(n) (i.e., the number of divisors of n) is greater than for any smaller n. Superabundant numbers ...

Linear programming, sometimes known as linear optimization, is the problem of maximizing or minimizing a linear function over a convex polyhedron specified by linear and ...

The abundance of a number n, sometimes also called the abundancy (a term which in this work, is reserved for a different but related quantity), is the quantity ...

Let a particle travel a distance s(t) as a function of time t (here, s can be thought of as the arc length of the curve traced out by the particle). The speed (the scalar ...

Adomian polynomials decompose a function u(x,t) into a sum of components u(x,t)=sum_(n=0)^inftyu_n(x,t) (1) for a nonlinear operator F as F(u(x,t))=sum_(n=0)^inftyA_n. (2) ...