Search Results for ""
331 - 340 of 887 for Full Reptend PrimesSearch Results
Two numbers are homogeneous if they have identical prime factors. An example of a homogeneous pair is (6, 72), both of which share prime factors 2 and 3: 6 = 2·3 (1) 72 = ...
When f:A->B is a ring homomorphism and b is an ideal in B, then f^(-1)(b) is an ideal in A, called the contraction of b and sometimes denoted b^c. The contraction of a prime ...
A process of successively crossing out members of a list according to a set of rules such that only some remain. The best known sieve is the sieve of Eratosthenes for ...
A totative is a positive integer less than or equal to a number n which is also relatively prime to n, where 1 is counted as being relatively prime to all numbers. The number ...
17 is a Fermat prime, which means that the 17-sided regular polygon (the heptadecagon) is constructible using compass and straightedge (as proved by Gauss).
If a is an element of a field F over the prime field P, then the set of all rational functions of a with coefficients in P is a field derived from P by adjunction of a.
If a and n are relatively prime so that the greatest common divisor GCD(a,n)=1, then a^(lambda(n))=1 (mod n), where lambda is the Carmichael function.
The Cramér conjecture is the unproven conjecture that lim sup_(n->infty)(p_(n+1)-p_n)/((lnp_n)^2)=1, where p_n is the nth prime.
The distinct prime factors of a positive integer n>=2 are defined as the omega(n) numbers p_1, ..., p_(omega(n)) in the prime factorization ...
A number D that possesses no common divisor with a prime number p is either a quadratic residue or nonresidue of p, depending whether D^((p-1)/2) is congruent mod p to +/-1.
...
View search results from all Wolfram sites (10913 matches)

