Search Results for ""

A modification of the Eberhart's conjecture proposed by Wagstaff (1983) which proposes that if q_n is the nth prime such that M_(q_n) is a Mersenne prime, then ...

An emirp ("prime" spelled backwards) is a prime whose (base 10) reversal is also prime, but which is not a palindromic prime. The first few are 13, 17, 31, 37, 71, 73, 79, ...

Let N be an odd integer, and assume there exists a Lucas sequence {U_n} with associated Sylvester cyclotomic numbers {Q_n} such that there is an n>sqrt(N) (with n and N ...

When ac is divisible by a number b that is relatively prime to a, then c must be divisible by b.

Let p_i denote the ith prime, and write m=product_(i)p_i^(v_i). Then the exponent vector is v(m)=(v_1,v_2,...).

If q_n is the nth prime such that M_(q_n) is a Mersenne prime, then q_n∼(3/2)^n. It was modified by Wagstaff (1983) to yield Wagstaff's conjecture, q_n∼(2^(e^(-gamma)))^n, ...

If bc=bd (mod a) and (b,a)=1 (i.e., a and b are relatively prime), then c=d (mod a).

For p an odd prime and a positive integer a which is not a multiple of p, a^((p-1)/2)=(a/p) (mod p), where (a|p) is the Legendre symbol.

The number of "prime" boxes is always finite, where a set of boxes is prime if it cannot be built up from one or more given configurations of boxes.

If R is a ring (commutative with 1), the height of a prime ideal p is defined as the supremum of all n so that there is a chain p_0 subset ...p_(n-1) subset p_n=p where all ...