Search Results for ""

A Calkin-Wilf tree is a special type of binary tree obtained by starting with the fraction 1/1 and iteratively adding a/(a+b) and (a+b)/b below each fraction a/b. The ...

The prime HP(n) reached starting from a number n, concatenating its prime factors, and repeating until a prime is reached. For example, for n=9, 9=3·3->33=3·11->311, so 311 ...

A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...

A number (usually base 10 unless specified otherwise) which has no digitaddition generator. Such numbers were originally called Colombian numbers (S. 1974). There are ...

A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...

The phrase "convergence in mean" is used in several branches of mathematics to refer to a number of different types of sequential convergence. In functional analysis, ...

Dini's theorem is a result in real analysis relating pointwise convergence of sequences of functions to uniform convergence on a closed interval. For an increasing sequence ...

The sequence of six 9s which begins at the 762nd decimal place of pi, pi=3.14159...134999999_()_(six 9s)837... (Wells 1986, p. 51). The positions of the first occurrences of ...

For all n, there exists a k such that the kth term of the Goodstein sequence G_k(n)=0. In other words, every Goodstein sequence converges to 0. The secret underlying ...

The grid shading problem is the problem of proving the unimodality of the sequence {a_1,a_2,...,a_(mn)}, where for fixed m and n, a_i is the number of partitions of i with at ...