Search Results for ""

The use of three prior points in a root-finding algorithm to estimate the zero crossing.

n divides a^n-a for all integers a iff n is squarefree and (p-1)|(n-1) for all prime divisors p of n. Carmichael numbers satisfy this criterion.

A lattice embedding is a one-to-one lattice homomorphism.

Little-omega notation is the inverse of the Landau symbol o, i.e., f(n) in o(phi(n)) <==> phi(n) in omega(f(n)).

The result of a matrix multiplication.

The minimum excluded value. The mex of a set S of nonnegative integers is the least nonnegative integer not in the set.

A multidimensional polylogarithm is a generalization of the usual polylogarithm to L_(a_1,...,a_m)(z)=sum_(n_1>...>n_m>0)(z^(n_1))/(n_1^(a_1)...n_m^(a_m)) with positive ...

A function f(n) has the normal order F(n) if f(n) is approximately F(n) for almost all values of n. More precisely, if (1-epsilon)F(n)<f(n)<(1+epsilon)F(n) for every positive ...

A fixed point of a linear transformation for which the rescaled variables satisfy (delta-alpha)^2+4betagamma=0.

A line and a plane are parallel if they do not intersect.