Search Results for ""

The number of digits D in an integer n is the number of numbers in some base (usually 10) required to represent it. The numbers 1 to 9 are therefore single digits, while the ...

A number n is called an Egyptian number if it is the sum of the denominators in some unit fraction representation of a positive whole number not consisting entirely of 1s. ...

Napier's bones, also called Napier's rods, are numbered rods which can be used to perform multiplication of any number by a number 2-9. By placing "bones" corresponding to ...

Wang's conjecture states that if a set of tiles can tile the plane, then they can always be arranged to do so periodically (Wang 1961). The conjecture was refuted when Berger ...

The determination of the number of monotone Boolean functions of n variables (equivalent to the number of antichains on the n-set {1,2,...,n}) is called Dedekind's problem, ...

Let p(n) be the first prime which follows a prime gap of n between consecutive primes. Shanks' conjecture holds that p(n)∼exp(sqrt(n)). Wolf conjectures a slightly different ...

A Smarandache-like function which is defined where S_k(n) is defined as the smallest integer for which n|S_k(n)^k. The Smarandache S_k(n) function can therefore be obtained ...

The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...

In the technical combinatorial sense, an a-ary necklace of length n is a string of n characters, each of a possible types. Rotation is ignored, in the sense that b_1b_2...b_n ...

Landau's problems are the four "unattackable" problems mentioned by Landau in the 1912 Fifth Congress of Mathematicians in Cambridge, namely: 1. The Goldbach conjecture, 2. ...