Search Results for ""

A busy beaver is an n-state, 2-color Turing machine which writes a maximum number Sigma(n) of 1s before halting (Rado 1962; Lin and Rado 1965; Shallit 1998). Alternatively, ...

The complex numbers are the field C of numbers of the form x+iy, where x and y are real numbers and i is the imaginary unit equal to the square root of -1, sqrt(-1). When a ...

For a given m, determine a complete list of fundamental binary quadratic form discriminants -d such that the class number is given by h(-d)=m. Heegner (1952) gave a solution ...

The Hall-Janko graph, also known as the Hall-Janko-Wales graph, is a strongly regular graph on 100 nodes with parameters (nu,k,lambda,mu)=(100,36,14,12). It is also a ...

The graph sum of graphs G and H is the graph with adjacency matrix given by the sum of adjacency matrices of G and H. A graph sum is defined when the orders of G and H are ...

The function defined by chi_nu(z)=sum_(k=0)^infty(z^(2k+1))/((2k+1)^nu). (1) It is related to the polylogarithm by chi_nu(z) = 1/2[Li_nu(z)-Li_nu(-z)] (2) = ...

In Book IX of The Elements, Euclid gave a method for constructing perfect numbers (Dickson 2005, p. 3), although this method applies only to even perfect numbers. In a 1638 ...

Two lines PQ and RS are said to be antiparallel with respect to the sides of an angle A if they make the same angle in the opposite senses with the bisector of that angle. If ...

Sarnak's constant is the constant C_(Sarnak) = product_(p>=3)(1-(p+2)/(p^3)) (1) = 0.7236484022... (2) (OEIS A065476), where the product is over the odd primes.

A base-60, or sexagesimal, number system, used by the ancient Babylonians.