Search Results for ""

Significance arithmetic is the arithmetic of approximate numerical quantities that not only keeps track of numerical results, but also uses error propagation to track their ...

Relates invariants of a curve defined over the integers. If this inequality were proven true, then Fermat's last theorem would follow for sufficiently large exponents. ...

A large number defined as where the circle notation denotes "n in n squares," and triangles and squares are expanded in terms of Steinhaus-Moser notation (Steinhaus 1999, pp. ...

Let C be an error-correcting code consisting of N codewords,in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...

The mathematical study of how given quantities can be approximated by other (usually simpler) ones under appropriate conditions. Approximation theory also studies the size ...

The approximation of a piecewise monotonic function f by a polynomial with the same monotonicity. Such comonotonic approximations can always be accomplished with nth degree ...

A powerful numerical integration technique which uses k refinements of the extended trapezoidal rule to remove error terms less than order O(N^(-2k)). The routine advocated ...

Every sufficiently large odd number is a sum of three primes (Vinogradov 1937). Ramachandra and Sankaranarayanan (1997) have shown that for sufficiently large n, the error ...

Coding theory, sometimes called algebraic coding theory, deals with the design of error-correcting codes for the reliable transmission of information across noisy channels. ...

Let C be an error-correcting code consisting of N codewords in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...