Search Results for ""

A problem posed by the Slovak mathematician Stefan Znám in 1972 asking whether, for all integers k>=2, there exist k integers x_1,...,x_k all greater than 1 such that x_i is ...

Graham's biggest little hexagon is the largest possible (not necessarily regular) convex hexagon with polygon diameter 1 (i.e., for which no two of the vertices are more than ...

Find the maximum number of bishops B(n) that can be placed on an n×n chessboard such that no two attack each other. The answer is 2n-2 (Dudeney 1970, Madachy 1979), giving ...

A binary unit of information equal to 8 bits. Unfortunately, the storage of binary numbers in computers is not entirely standardized. Because computers store information in ...

The Connell sequence is the sequence obtained by starting with the first positive odd number (1), taking the next two even numbers (2, 4), the next three odd numbers (5, 7, ...

Given a number n, Fermat's factorization methods look for integers x and y such that n=x^2-y^2. Then n=(x-y)(x+y) (1) and n is factored. A modified form of this observation ...

Let E be a compact connected subset of d-dimensional Euclidean space. Gross (1964) and Stadje (1981) proved that there is a unique real number a(E) such that for all x_1, ...

There are a number of functions in various branches of mathematics known as Riemann functions. Examples include the Riemann P-series, Riemann-Siegel functions, Riemann theta ...

There are (at least) two mathematical constants associated with Theodorus. The first Theodorus's constant is the elementary algebraic number sqrt(3), i.e., the square root of ...

A nialpdrome is a number whose hexadecimal digits are in nonincreasing order. The first few are 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 32, 33, 34, 48, 49, ...