Search Results for ""

The hypothesis that an integer n is prime iff it satisfies the condition that 2^n-2 is divisible by n. Dickson (2005, p. 91) stated that Leibniz believe to have proved that ...

Consider the forms Q for which the generic characters chi_i(Q) are equal to some preassigned array of signs e_i=1 or -1, e_1,e_2,...,e_r, subject to product_(i=1)^(r)e_i=1. ...

Let P be a prime ideal in D_m not containing m. Then (Phi(P))=P^(sumtsigma_t^(-1)), where the sum is over all 1<=t<m which are relatively prime to m. Here D_m is the ring of ...

Chebyshev noticed that the remainder upon dividing the primes by 4 gives 3 more often than 1, as plotted above in the left figure. Similarly, dividing the primes by 3 gives 2 ...

The series producing Brun's constant converges even if there are an infinite number of twin primes, first proved by Brun (1919).

The Schnirelmann density of a set of nonnegative integers is the greatest lower bound of the fractions A(n)/n where A(n) is the number of terms in the set <=n.

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

An integer is k-smooth if it has no prime factors >k. The following table gives the first few k-smooth numbers for small k. Berndt (1994, p. 52) called the 7-smooth numbers ...

A Mersenne number is a number of the form M_n=2^n-1, (1) where n is an integer. The Mersenne numbers consist of all 1s in base-2, and are therefore binary repunits. The first ...

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