Search Results for ""

Lehmer's totient problem asks if there exist any composite numbers n such that phi(n)|(n-1), where phi(n) is the totient function? No such numbers are known. However, any ...

Let T(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Define f_m(x)=product_(t in T(m))(x-t). (1) Then a ...

Every finite Abelian group can be written as a group direct product of cyclic groups of prime power group orders. In fact, the number of nonisomorphic Abelian finite groups ...

If a number fails Miller's primality test for some base a, it is not a prime. If the number passes, it may be a prime. A composite number passing Miller's test is called a ...

Each of the sets forming a direct product is said to be a direct factor. A group G is said to be a direct factor of the group G^' if G^' is isomorphic to the group direct ...

An element a of a ring which is nonzero, not a unit, and whose only divisors are the trivial ones (i.e., the units and the products ua, where u is a unit). Equivalently, an ...

Let n-1=FR where F is the factored part of a number F=p_1^(a_1)...p_r^(a_r), (1) where (R,F)=1, and R<sqrt(n). Pocklington's theorem, also known as the Pocklington-Lehmer ...

A complex magnification is a map of the form z|->az, where a is a positive real number, which corresponds to magnification about the origin of points in the complex plane by ...

Number Theory

Let p be an odd prime, a be a positive number such that pa (i.e., p does not divide a), and let x be one of the numbers 1, 2, 3, ..., p-1. Then there is a unique x^', called ...