Search Results for ""

The ordinary differential equation (1) (Byerly 1959, p. 255). The solution is denoted E_m^p(x) and is known as an ellipsoidal harmonic of the first kind, or Lamé function. ...

Whittaker and Watson (1990, pp. 539-540) write Lamé's differential equation for ellipsoidal harmonics of the first kind of the four types as ...

For n>=1, let u and v be integers with u>v>0 such that the Euclidean algorithm applied to u and v requires exactly n division steps and such that u is as small as possible ...

A two-dimensional planar closed surface L which has a mass M and a surface density sigma(x,y) (in units of mass per areas squared) such that M=int_Lsigma(x,y)dxdy. The center ...

A lattice which is built up of layers of n-dimensional lattices in (n+1)-dimensional space. The vectors specifying how layers are stacked are called glue vectors. The order ...

Given a 111×111 (0,1)-matrix, fill 11 spaces in each row in such a way that all columns also have 11 spaces filled. Furthermore, each pair of rows must have exactly one ...

Let a space curve have line elements ds_N, ds_T, and ds_B along the normal, tangent, and binormal vectors respectively, then ds_N^2=ds_T^2+ds_B^2, (1) where ds_N^2 = ...

A necessary and sufficient condition for a curve to be a helix is that the ratio of curvature to torsion be constant.

An algorithm for computing the eigenvalues and eigenvectors for large symmetric sparse matrices.

An approximation for the gamma function Gamma(z+1) with R[z]>0 is given by Gamma(z+1)=sqrt(2pi)(z+sigma+1/2)^(z+1/2)e^(-(z+sigma+1/2))sum_(k=0)^inftyg_kH_k(z), (1) where ...