Search Results for ""

There are several types of numbers that are commonly termed "lucky numbers." The first is the lucky numbers of Euler. The second is obtained by writing out all odd numbers: ...

Given a map with genus g>0, Heawood showed in 1890 that the maximum number N_u of colors necessary to color a map (the chromatic number) on an unbounded surface is N_u = ...

A polyhedral nonhamiltonian graph is a graph that is simultaneously polyhedral and nonhamiltonian. The smallest possible number of vertices a nonhamiltonian polyhedral graph ...

The numbers of positive definite n×n matrices of given types are summarized in the following table. For example, the three positive eigenvalues 2×2 (0,1)-matrices are [1 0; 0 ...

Serre's problem, also called Serre's conjecture, asserts that the implication "free module ==> projective module" can be reversed for every module over the polynomial ring ...

As proved by Sierpiński (1960), there exist infinitely many positive odd numbers k such that k·2^n+1 is composite for every n>=1. Numbers k with this property are called ...

A sutured manifold is a tool in geometric topology which was first introduced by David Gabai in order to study taut foliations on 3-manifolds. Roughly, a sutured manifold is ...

The number of colors sufficient for map coloring on a surface of genus g is given by the Heawood conjecture, chi(g)=|_1/2(7+sqrt(48g+1))_|, where |_x_| is the floor function. ...

Informally, an elliptic curve is a type of cubic curve whose solutions are confined to a region of space that is topologically equivalent to a torus. The Weierstrass elliptic ...

A general quadratic Diophantine equation in two variables x and y is given by ax^2+cy^2=k, (1) where a, c, and k are specified (positive or negative) integers and x and y are ...