HOME

TheInfoList



OR:

In
number theory Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure mathematics devoted primarily to the study of the integers and integer-valued functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Mathe ...
, a branch of mathematics, Dickson's conjecture is the conjecture stated by that for a finite set of linear forms , , ..., with , there are infinitely many positive integers for which they are all
prime A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways ...
, unless there is a congruence condition preventing this . The case ''k'' = 1 is Dirichlet's theorem. Two other special cases are well-known conjectures: there are infinitely many
twin prime A twin prime is a prime number that is either 2 less or 2 more than another prime number—for example, either member of the twin prime pair (41, 43). In other words, a twin prime is a prime that has a prime gap of two. Sometimes the term ''twin pr ...
s (''n'' and 2 + ''n'' are primes), and there are infinitely many
Sophie Germain prime In number theory, a prime number ''p'' is a if 2''p'' + 1 is also prime. The number 2''p'' + 1 associated with a Sophie Germain prime is called a . For example, 11 is a Sophie Germain prime and 2 × 11 +  ...
s (''n'' and 1 + 2''n'' are primes). Dickson's conjecture is further extended by
Schinzel's hypothesis H In mathematics, Schinzel's hypothesis H is one of the most famous open problems in the topic of number theory. It is a very broad generalization of widely open conjectures such as the twin prime conjecture. The hypothesis is named after Andrzej Sch ...
.


Generalized Dickson's conjecture

Given ''n'' polynomials with positive degrees and integer coefficients (''n'' can be any natural number) that each satisfy all three conditions in the
Bunyakovsky conjecture The Bunyakovsky conjecture (or Bouniakowsky conjecture) gives a criterion for a polynomial f(x) in one variable with integer coefficients to give infinitely many prime values in the sequencef(1), f(2), f(3),\ldots. It was stated in 1857 by the R ...
, and for any prime ''p'' there is an integer ''x'' such that the values of all ''n'' polynomials at ''x'' are not divisible by ''p'', then there are infinitely many positive integers ''x'' such that all values of these ''n'' polynomials at ''x'' are prime. For example, if the conjecture is true then there are infinitely many positive integers ''x'' such that ''x''2 + 1, 3''x'' - 1, and ''x''2 + ''x'' + 41 are all prime. When all the polynomials have degree 1, this is the original Dickson's conjecture. This more general conjecture is the same as the Generalized Bunyakovsky conjecture.


See also

*
Prime triplet In number theory, a prime triplet is a set of three prime numbers in which the smallest and largest of the three differ by 6. In particular, the sets must have the form or . With the exceptions of and , this is the closest possible grouping of t ...
*
Green–Tao theorem In number theory, the Green–Tao theorem, proved by Ben Green and Terence Tao in 2004, states that the sequence of prime numbers contains arbitrarily long arithmetic progressions. In other words, for every natural number ''k'', there exist arith ...
*
First Hardy–Littlewood conjecture A twin prime is a prime number that is either 2 less or 2 more than another prime number—for example, either member of the twin prime pair (41, 43). In other words, a twin prime is a prime that has a prime gap of two. Sometimes the term ''twin p ...
*
Prime constellation In number theory, a prime -tuple is a finite collection of values representing a repeatable pattern of differences between prime numbers. For a -tuple , the positions where the -tuple matches a pattern in the prime numbers are given by the set o ...
*
Primes in arithmetic progression In number theory, primes in arithmetic progression are any sequence of at least three prime numbers that are consecutive terms in an arithmetic progression. An example is the sequence of primes (3, 7, 11), which is given by a_n = 3 + 4n for 0 \le n ...


References

* * {{Prime number conjectures Conjectures about prime numbers Unsolved problems in number theory