Search Results for ""

The Euler-Gergonne-Soddy circle, a term coined here for the first time, is the circumcircle of the Euler-Gergonne-Soddy triangle. Since the Euler-Gergonne-Soddy triangle is a ...

Two numbers which are relatively prime.

There exist infinitely many n>0 with p_n^2>p_(n-i)p_(n+i) for all i<n, where p_n is the nth prime. Also, there exist infinitely many n>0 such that 2p_n<p_(n-i)+p_(n+i) for ...

A map x|->x^p where p is a prime.

Each prime factor p_i^(alpha_i) in an integer's prime factorization is called a primary.

A prime factorization algorithm.

The second Mersenne prime M_3=2^3-1, which is itself the exponent of Mersenne prime M_7=2^7-1=127. It gives rise to the perfect number P_7=M_7·2^6=8128. It is a Gaussian ...

For N=k·2^n+1 with k odd and 2^n>k, if there exists an integer a such that a^((N-1)/2)=-1 (mod N), then N is prime. A prime of this form is known as a Proth prime.

A test which always identifies prime numbers correctly, but may incorrectly identify a composite number as a prime.

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 ...