Search Results for ""

An oriented surface for which every point belongs to a Wiedersehen pair. Proof of the Blaschke conjecture established that the only Wiedersehen surfaces are the standard ...

Any composite number n with p|(n/p-1) for all prime divisors p of n. n is a Giuga number iff sum_(k=1)^(n-1)k^(phi(n))=-1 (mod n) (1) where phi is the totient function and ...

Two nonisomorphic graphs that have equal resistance spectra (i.e., multisets of resistance distances) are said to be resistance-equivalent. All nonisomorphic simple graphs on ...

van der Waerden's theorem is a theorem about the existence of arithmetic progressions in sets. The theorem can be stated in four equivalent forms. 1. If N=C_1 union C_2 union ...

7 7 6 6 3 1; 6 5 4 2 ; 3 3 ; 2 A descending plane partition of order n is a two-dimensional array (possibly empty) of positive integers less than or equal to n such that the ...

Let a^p+b^p=c^p be a solution to Fermat's last theorem. Then the corresponding Frey curve is y^2=x(x-a^p)(x+b^p). (1) Ribet (1990a) showed that such curves cannot be modular, ...

Honaker's problem asks for all consecutive prime number triples (p,q,r) with p<q<r such that p|(qr+1). Caldwell and Cheng (2005) showed that the only Honaker triplets for ...

Mann's theorem is a theorem widely circulated as the "alpha-beta conjecture" that was subsequently proven by Mann (1942). It states that if A and B are sets of integers each ...

The graph complement of a perfect graph is itself perfect. Originally known as the weak perfect graph conjecture (Fulkerson 1971), the result was subsequently proved by ...

A random polygon is a polygon generated in some random way. Kendall conjectured that the shape of a random polygon is close to a disk as the area of the polygon becomes large ...