Search Results for ""

Newton's method, also called the Newton-Raphson method, is a root-finding algorithm that uses the first few terms of the Taylor series of a function f(x) in the vicinity of a ...

where _5F_4(a,b,c,d,e;f,g,h,i;z) is a generalized hypergeometric function and Gamma(z) is the gamma function. Bailey (1935, pp. 25-26) called the Dougall-Ramanujan identity ...

The Eisenstein integers, sometimes also called the Eisenstein-Jacobi integers (Finch 2003, p. 601), are numbers of the form a+bomega, where a and b are normal integers, ...

If f(x) is piecewise continuous and has a generalized Fourier series sum_(i)a_iphi_i(x) (1) with weighting function w(x), it must be true that ...

The Lester circle is the circle on which the circumcenter C, nine-point center N, and the first and second Fermat points X and X^' lie (Kimberling 1998, pp. 229-230). Besides ...

The map which assigns every member of a set A to the same element id_A. It is identical to the identity function.

A set A of integers is recursively isomorphic to set B if there is a bijective recursive function f such that f(A)=B.

The sequency k of a Walsh function is defined as half the number of zero crossings in the time base.

The property intf(y)delta(x-y)dy=f(x) obeyed by the delta function delta(x).

The study of valuations which simplifies class field theory and the theory of function fields.