Bunyakovsky conjecture

if an integer-coefficient polynomial f has a positive leading coefficient, is irreducible over the integers, and has no common factors over all f(x) where x is a positive integer, then f(x) is prime infinitely often.

Open the “Prime numbers” section on Wikipedia →

Source: List of unsolved problems in mathematics (CC BY-SA 4.0)