Portal:Number theory/Selected article

Selected Article

The Riemann hypothesis, first formulated by Bernhard Riemann in 1859, is one of the most famous and important unsolved problems in mathematics. It has been an open question for almost 150 years, despite attracting concentrated efforts from many outstanding mathematicians. Unlike some other celebrated problems, it is more attractive to professionals in the field than to amateurs.

The Riemann hypothesis (RH) is a conjecture about the distribution of the zeros of the Riemann zeta-function ζ(s). The Riemann zeta-function is defined for all complex numbers s ≠ 1. It has zeros at the negative even integers. These are called the trivial zeros. The Riemann hypothesis is concerned with the non-trivial zeros, and states that the real part of any non-trivial zero of the Riemann zeta function is ½.

Selected Article

In number theory, the prime number theorem describes the asymptotic distribution of the prime numbers. The prime number theorem gives a rough description of how the primes are distributed.

Roughly speaking, the prime number theorem (PNT) states that if you randomly select a number nearby some large number N, the chance of it being prime is about 1 / ln(N), where ln(N) denotes the natural logarithm of N. For example, near N = 10,000, about one in nine numbers is prime, whereas near N = 1,000,000,000, only one in every 21 numbers is prime.

Selected Article

In number theory, Sylvester's sequence is a sequence of integers in which each member of the sequence is the product of the previous members, plus one. Sylvester's sequence is named after James Joseph Sylvester, who first investigated it in 1880.

Its values grow doubly exponentially, and the sum of its reciprocals forms a series of unit fractions that converges to 1 more rapidly than any other series of unit fractions with the same sum. The recurrence by which it is defined allows the numbers in the sequence to be factored more easily than other numbers of the same magnitude, but, due to the rapid growth of the sequence, complete prime factorizations are known only for a few of its members. Values derived from this sequence have also been used to construct finite Egyptian fraction representations of 1, Sasakian Einstein manifolds, and hard instances for online algorithms.

Selected Article

In mathematics, the Pell numbers and companion Pell numbers are both sequences of integers that have been known since ancient times. They are defined by a recurrence relation similar to that for the Fibonacci numbers, and grow exponentially, proportionally to powers of the silver ratio. Pell numbers arise in the approximation of the square root of 2, in the definition of square triangular numbers, in the construction of nearly-isosceles integer right triangles, and in certain combinatorial enumeration problems.

As with Pell's equation, the name of the Pell numbers stems from Leonhard Euler's mistaken attribution of the equation and the numbers derived from it to John Pell. The Pell-Lucas numbers are also named after Edouard Lucas, who studied sequences defined by recurrences of this type; the Pell and companion Pell numbers are Lucas sequences.

Selected Article

In number theory, Znám's problem asks which sets of k integers have the property that each integer in the set is a proper divisor of the product of the other integers in the set, plus 1. Znám's problem is named after the Slovak mathematician Štefan Znám, who suggested it in 1972, although other mathematicians had considered similar problems around the same time. One closely related problem drops the assumption of properness of the divisor, and will be called the improper Znám problem hereafter.

One solution to the improper Znám problem is easily provided for any k: the first k terms of Sylvester's sequence have the required property. Sun (1983) showed that there is at least one solution to the (proper) Znám problem for each k ≥ 5. Sun's solution is based on a recurrence similar to that for Sylvester's sequence, but with a different set of initial values.