Search Results for ""

An affine variety V is an algebraic variety contained in affine space. For example, {(x,y,z):x^2+y^2-z^2=0} (1) is the cone, and {(x,y,z):x^2+y^2-z^2=0,ax+by+cz=0} (2) is a ...

Consider decomposition the factorial n! into multiplicative factors p_k^(b_k) arranged in nondecreasing order. For example, 4! = 3·2^3 (1) = 2·3·4 (2) = 2·2·2·3 (3) and 5! = ...

An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...

The term analysis is used in two ways in mathematics. It describes both the discipline of which calculus is a part and one form of abstract logic theory. Analysis is the ...

An apodization function (also called a tapering function or window function) is a function used to smoothly bring a sampled signal down to zero at the edges of the sampled ...

The n-ball, denoted B^n, is the interior of a sphere S^(n-1), and sometimes also called the n-disk. (Although physicists often use the term "sphere" to mean the solid ball, ...

The Bernoulli numbers B_n are a sequence of signed rational numbers that can be defined by the exponential generating function x/(e^x-1)=sum_(n=0)^infty(B_nx^n)/(n!). (1) ...

A Bessel function Z_n(x) is a function defined by the recurrence relations Z_(n+1)+Z_(n-1)=(2n)/xZ_n (1) and Z_(n+1)-Z_(n-1)=-2(dZ_n)/(dx). (2) The Bessel functions are more ...

Brocard's problem asks to find the values of n for which n!+1 is a square number m^2, where n! is the factorial (Brocard 1876, 1885). The only known solutions are n=4, 5, and ...

A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves ...