Search Results for ""

The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in ...

The Beatty sequence is a spectrum sequence with an irrational base. In other words, the Beatty sequence corresponding to an irrational number theta is given by |_theta_|, ...

Gaussian elimination is a method for solving matrix equations of the form Ax=b. (1) To perform Gaussian elimination starting with the system of equations [a_(11) a_(12) ... ...

An integer is k-smooth if it has no prime factors >k. The following table gives the first few k-smooth numbers for small k. Berndt (1994, p. 52) called the 7-smooth numbers ...

The word "base" in mathematics is used to refer to a particular mathematical object that is used as a building block. The most common uses are the related concepts of the ...

A special function mostly commonly denoted psi_n(z), psi^((n))(z), or F_n(z-1) which is given by the (n+1)st derivative of the logarithm of the gamma function Gamma(z) (or, ...

A branch point of an analytic function is a point in the complex plane whose complex argument can be mapped from a single point in the domain to multiple points in the range. ...

A binary unit of information equal to 8 bits. Unfortunately, the storage of binary numbers in computers is not entirely standardized. Because computers store information in ...

Given a triangle with polygon vertices A, B, and C and points along the sides D, E, and F, a necessary and sufficient condition for the cevians AD, BE, and CF to be ...

An algebraic surface with affine equation P_d(x_1,x_2)+T_d(x_3)=0, (1) where T_d(x) is a Chebyshev polynomial of the first kind and P_d(x_1,x_2) is a polynomial defined by ...