Skip to main content
MathOverflow

Return to Question

deleted 90 characters in body
Source Link
Steven Landsburg
Steven Landsburg
  • 23k
  • 5
  • 95
  • 153

Recently I was studying a particular problem and I was faced with the following question: Is $d^2+d+1$ prime for infinitely many $d\in \mathbb{Z}_{>0}$?

This is expected by the Bunyakovsky conjecture which says that, under some conditions, given a polynomial $p(x) \in \mathbb{Z}[x]$ we have $p(d)$ prime for infinitely many $d\in \mathbb{Z}_{>0}$. Is there some proof of this when $p(x) = x^2+x+1$?

Recently I was studying a particular problem and I was faced with the following question: Is $d^2+d+1$ prime for infinitely many $d\in \mathbb{Z}_{>0}$?

This is expected by the Bunyakovsky conjecture which says that, under some conditions, given a polynomial $p(x) \in \mathbb{Z}[x]$ we have $p(d)$ prime for infinitely many $d\in \mathbb{Z}_{>0}$. Is there some proof of this when $p(x) = x^2+x+1$?

Is $d^2+d+1$ prime for infinitely many $d\in \mathbb{Z}_{>0}$?

This is expected by the Bunyakovsky conjecture which says that, under some conditions, given a polynomial $p(x) \in \mathbb{Z}[x]$ we have $p(d)$ prime for infinitely many $d\in \mathbb{Z}_{>0}$. Is there some proof of this when $p(x) = x^2+x+1$?

Source Link
numberwat
numberwat
  • 348
  • 1
  • 9

Primes of the form $d^2+d+1$

Recently I was studying a particular problem and I was faced with the following question: Is $d^2+d+1$ prime for infinitely many $d\in \mathbb{Z}_{>0}$?

This is expected by the Bunyakovsky conjecture which says that, under some conditions, given a polynomial $p(x) \in \mathbb{Z}[x]$ we have $p(d)$ prime for infinitely many $d\in \mathbb{Z}_{>0}$. Is there some proof of this when $p(x) = x^2+x+1$?