Search Results for ""

The 2-cusped epicycloid is called a nephroid. The name nephroid means "kidney shaped" and was first used for the two-cusped epicycloid by Proctor in 1878 (MacTutor Archive). ...

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs. The Goldner-Harary graph (Goldner and Harary 1975a, ...

Every odd integer n is a prime or the sum of three primes. This problem is closely related to Vinogradov's theorem.

If the first case of Fermat's last theorem is false for the prime exponent p, then 3^(p-1)=1 (mod p^2).

A specific type of ultraproduct that can be used to construct nonstandard universes and obtain the transfer principle as a corollary of Łoś' theorem for ultraproducts.

The weak law of large numbers (cf. the strong law of large numbers) is a result in probability theory also known as Bernoulli's theorem. Let X_1, ..., X_n be a sequence of ...

The number obtained by adding the reciprocals of the odd twin primes, B=(1/3+1/5)+(1/5+1/7)+(1/(11)+1/(13))+(1/(17)+1/(19))+.... (1) By Brun's theorem, the series converges ...

The Errera graph is the 17-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

The 10_3 configuration of ten lines intersecting three at a time in 10 points which arises in Desargues' theorem. Its Levi graph is the Desargues graph.

The Diophantine equation x^n+y^n=z^n. The assertion that this equation has no nontrivial solutions for n>2 has a long and fascinating history and is known as Fermat's last ...