Search Results for ""

The first strong law of small numbers (Gardner 1980, Guy 1988, 1990) states "There aren't enough small numbers to meet the many demands made of them." The second strong law ...

A subset is a portion of a set. B is a subset of A (written B subset= A) iff every member of B is a member of A. If B is a proper subset of A (i.e., a subset other than the ...

A number n such that sigma^2(n)=sigma(sigma(n))=2n, where sigma(n) is the divisor function is called a superperfect number. Even superperfect numbers are just 2^(p-1), where ...

Surreal numbers are the most natural collection of numbers which includes both the real numbers and the infinite ordinal numbers of Georg Cantor. They were invented by John ...

In the early 1960s, B. Birch and H. P. F. Swinnerton-Dyer conjectured that if a given elliptic curve has an infinite number of solutions, then the associated L-series has ...

Ramanujan's Dirichlet L-series is defined as f(s)=sum_(n=1)^infty(tau(n))/(n^s), (1) where tau(n) is the tau function. Note that the notation F(s) is sometimes used instead ...

The tetrahedral group T_d is the point group of symmetries of the tetrahedron including the inversion operation. It is one of the 12 non-Abelian groups of order 24. The ...

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

A group action G×X->X is transitive if it possesses only a single group orbit, i.e., for every pair of elements x and y, there is a group element g such that gx=y. In this ...

Graph Strength