Search Results for ""

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

In 1976, Coates and Wiles showed that elliptic curves with complex multiplication having an infinite number of solutions have L-functions which are zero at the relevant fixed ...

A number h which satisfies the conditions of the congruum problem: x^2+h=a^2 and x^2-h=b^2, where x,h,a,b are integers. The list of congrua is given by 24, 96, 120, 240, 336, ...

An Euler pseudoprime to the base b is a composite number n which satisfies b^((n-1)/2)=+/-1 (mod n). The first few base-2 Euler pseudoprimes are 341, 561, 1105, 1729, 1905, ...

Rubik's graph is the Cayley graph of Rubik's group. The graph diameter of this graph is sometimes known as God's number, and was shown in Aug. 2010 to be equal to 20 (Rokicki ...

Brown numbers are pairs (m,n) of integers satisfying the condition of Brocard's problem, i.e., such that n!+1=m^2 where n! is the factorial and m^2 is a square number. Only ...

For elliptic curves over the rationals Q, the group of rational points is always finitely generated (i.e., there always exists a finite set of group generators). This theorem ...

Every even number is the difference of two consecutive primes in infinitely many ways (Dickson 2005, p. 424). If true, taking the difference 2, this conjecture implies that ...

Fuglede (1974) conjectured that a domain Omega admits an operator spectrum iff it is possible to tile R^d by a family of translates of Omega. Fuglede proved the conjecture in ...

Schur (1916) proved that no matter how the set of positive integers less than or equal to |_n!e_| (where |_x_| is the floor function) is partitioned into n classes, one class ...