Search Results for ""

The nth roots of unity are roots e^(2piik/n) of the cyclotomic equation x^n=1, which are known as the de Moivre numbers. The notations zeta_k, epsilon_k, and epsilon_k, where ...

Rosser's rule states that every Gram block contains the expected number of roots, which appears to be true for computable Gram blocks. Rosser et al. (1969) expressed a belief ...

A rotation group is a group in which the elements are orthogonal matrices with determinant 1. In the case of three-dimensional space, the rotation group is known as the ...

For algebraic alpha |alpha-p/q|<1/(q^(2+epsilon)), with epsilon>0, has finitely many solutions. Klaus Roth received a Fields medal for this result.

If n>19, there exists a Poulet number between n and n^2. The theorem was proved in 1965.

Given two functions f and g analytic in A with gamma a simple loop homotopic to a point in A, if |g(z)|<|f(z)| for all z on gamma, then f and f+g have the same number of ...

The process of approximating a quantity, be it for convenience or, as in the case of numerical computations, of necessity. If rounding is performed on each of a series of ...

Hoffman (1998, p. 90) calls the sum of the exponents in the prime factorization of a number its roundness. The first few values for n=1, 2, ... are 0, 1, 1, 2, 1, 2, 1, 3, 2, ...

Consider the characteristic equation |lambdaI-A|=lambda^n+b_1lambda^(n-1)+...+b_(n-1)lambda+b_n=0 (1) determining the n eigenvalues lambda of a real n×n square matrix A, ...

A row-convex polyomino is a self-avoiding convex polyomino such that the intersection of any horizontal line with the polyomino has at most two connected components. A ...