Search Results for ""

The negabinary representation of a number n is its representation in base -2 (i.e., base negative 2). It is therefore given by the coefficients a_na_(n-1)...a_1a_0 in n = ...

A prime magic square is a magic square consisting only of prime numbers (although the number 1 is sometimes allowed in such squares). The left square is the 3×3 prime magic ...

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...

The function frac(x) giving the fractional (noninteger) part of a real number x. The symbol {x} is sometimes used instead of frac(x) (Graham et al. 1994, p. 70; Havil 2003, ...

Q(n), also denoted q(n) (Abramowitz and Stegun 1972, p. 825), gives the number of ways of writing the integer n as a sum of positive integers without regard to order with the ...

Sudoku (literally, "single number"), sometimes also is a pencil-and-paper logic puzzle whose goal is to complete a grid satisfying various constraints. In the "classic" ...

The Thue-Morse constant, also called the parity constant, is given by the concatenated digits of the Thue-Morse sequence P=0.0110100110010110100101100..._2 (1) (OEIS A010060) ...

In most computer programs and computing environments, the precision of any calculation (even including addition) is limited by the word size of the computer, that is, by ...

The Copeland-Erdős constant is the constant with decimal expansion 0.23571113171923... (OEIS A033308) obtained by concatenating consecutive primes: 2, 23, 235, 2357, 235711, ...

According to Hardy and Wright (1979), the 44-digit Ferrier's prime determined to be prime using only a mechanical calculator, is the largest prime found before the days of ...