Search Results for ""

Roundoff error is the difference between an approximation of a number used in computation and its exact (correct) value. In certain types of computation, roundoff error can ...

Let x be a real number, and let R be the set of positive real numbers mu for which 0<|x-p/q|<1/(q^mu) (1) has (at most) finitely many solutions p/q for p and q integers. Then ...

A strong pseudoprime to a base a is an odd composite number n with n-1=d·2^s (for d odd) for which either a^d=1 (mod n) (1) or a^(d·2^r)=-1 (mod n) (2) for some r=0, 1, ..., ...

A sequence whose terms are integers. The most complete printed references for such sequences are Sloane (1973) and its update, Sloane and Plouffe (1995). Neil Sloane ...

The integer sequence 1, 0, 1, 1, 2, 1, 3, 2, 4, 3, 5, 4, 7, 5, 8, 7, 10, 8, 12, 10, 14, 12, 16, 14, 19, 16, 21, 19, ... (OEIS A005044) given by the coefficients of the ...

Consider the problem of comparing two real numbers x and y based on their continued fraction representations. Then the mean number of iterations needed to determine if x<y or ...

A number of closed-form constants can be obtained for generalized continued fractions having particularly simple partial numerators and denominators. The Ramanujan continued ...

A hexahedron is a polyhedron with six faces. The figure above shows a number of named hexahedra, in particular the acute golden rhombohedron, cube, cuboid, hemicube, ...

An algebraic variety is a generalization to n dimensions of algebraic curves. More technically, an algebraic variety is a reduced scheme of finite type over a field K. An ...

Let G be a planar graph whose vertices have been properly colored and suppose v in V(G) is colored C_1. Define the C_1C_2-Kempe chain containing v to be the maximal connected ...