In number theory, Dickson's conjecture is the statement that for a finite set of linear forms with each , there are infinitely many positive integers for which they are all prime, unless there is a congruence condition preventing this.[1] The conjecture is named after Leonard Dickson, who first proposed it in 1904.[2]

The case is Dirichlet's theorem. Two other special cases are well-known conjectures: that there are infinitely many twin primes ( and are primes), and that there are infinitely many Sophie Germain primes ( and are primes).

Generalized Dickson's conjecture

edit

Given polynomials with positive degrees and integer coefficients ( can be any natural number) that each satisfy all three conditions in the Bunyakovsky conjecture, and for any prime there is an integer such that the values of all polynomials at are not divisible by , then there are infinitely many positive integers such that all values of these polynomials at are prime. For example, if the conjecture is true then there are infinitely many positive integers such that , , and are all prime. When all the polynomials have degree 1, this is the original Dickson's conjecture. This generalization is equivalent to the generalized Bunyakovsky conjecture and Schinzel's hypothesis H.

See also

edit

Notes

edit
  1. ^ Ribenboim, Paulo (1996) [1988]. "6. I". The New Book of Prime Number Records (3rd ed.). Springer New York. ISBN 978-0-387-94457-9. MR 1377060.
  2. ^ Dickson, L. E. (1904). "A new extension of Dirichlet's theorem on prime numbers" (PDF). Messenger of Mathematics. 33: 155–161.

References

edit

📚 Artikel Terkait di Wikipedia

Aliquot sequence

(sequence A005114 in the OEIS) An important conjecture due to Catalan, sometimes called the Catalan–Dickson conjecture, is that every aliquot sequence ends in

Twin prime

second Hardy–Littlewood conjecture is false. This conjecture has been extended by Dickson's conjecture. Polignac's conjecture from 1849 states that for

List of unsolved problems in mathematics

2000, six remain unsolved to date: Birch and Swinnerton-Dyer conjecture Hodge conjecture Navier–Stokes existence and smoothness P versus NP Riemann hypothesis

Polignac's conjecture

In number theory, Polignac's conjecture was made by Alphonse de Polignac in 1849 and states: For any positive even number n, there are infinitely many

List of conjectures

Aharoni-Korman conjecture also known as the fishbone conjecture Atiyah conjecture (not a conjecture to start with) Borsuk's conjecture Bunkbed conjecture Chinese

Bunyakovsky conjecture

The Bunyakovsky conjecture (or Bouniakowsky conjecture) gives a criterion for a polynomial f ( x ) {\displaystyle f(x)} in one variable with integer coefficients

Chevalley–Warning theorem

proved by Chevalley (1935). Chevalley's theorem implied Artin's and Dickson's conjecture that finite fields are quasi-algebraically closed fields (Artin 1982

Safe and Sophie Germain primes

this and the twin prime conjecture; they include Dickson's conjecture, Schinzel's hypothesis H, and the Bateman–Horn conjecture. A heuristic estimate for