Skip to main content
replaced http://mathoverflow.net/ with https://mathoverflow.net/
Source Link

The question is the following :

  • Question:

Does there exist infinitely many primes of the form $(2m+1)^2-2^{2s+1}$ with $m,s\geq 1$ ?

  • Why this could be true:

Bunyakowsky conjecture would imply that the answer is yes for any given $s$.

[ Indeed, the polynomial $4X^2+4X-2^{2s+1}+1$ is irreducible ($\Delta = 2^{2s+5}$), and no integer $d\geq 1$ can divide all values $P(n)$ (since $P(0)$ is odd and $P(1)-P(0)=8$) ]

Unfortunately, as the Wikipedia page indicates, Bunyakowsky conjecture is not known to hold for a single polynomial of degree $\geq 2$.

My hope is that allowing $s$ to assume infinitely many values can help ...

  • Why this could be hard:

As was pointed out by Mike Benett in this MO questionthis MO question, the density of primes of this form among primes that are congruent to $1$ mod $8$ is asymptotically $0$. (As an example, there are $20453$ primes $p<2^{20}$ that are congruent to $1$ mod. $8$, and only $1334$ among them that have the required form, so that the density up to that bound is only $0.065$).

The question is the following :

  • Question:

Does there exist infinitely many primes of the form $(2m+1)^2-2^{2s+1}$ with $m,s\geq 1$ ?

  • Why this could be true:

Bunyakowsky conjecture would imply that the answer is yes for any given $s$.

[ Indeed, the polynomial $4X^2+4X-2^{2s+1}+1$ is irreducible ($\Delta = 2^{2s+5}$), and no integer $d\geq 1$ can divide all values $P(n)$ (since $P(0)$ is odd and $P(1)-P(0)=8$) ]

Unfortunately, as the Wikipedia page indicates, Bunyakowsky conjecture is not known to hold for a single polynomial of degree $\geq 2$.

My hope is that allowing $s$ to assume infinitely many values can help ...

  • Why this could be hard:

As was pointed out by Mike Benett in this MO question, the density of primes of this form among primes that are congruent to $1$ mod $8$ is asymptotically $0$. (As an example, there are $20453$ primes $p<2^{20}$ that are congruent to $1$ mod. $8$, and only $1334$ among them that have the required form, so that the density up to that bound is only $0.065$).

The question is the following :

  • Question:

Does there exist infinitely many primes of the form $(2m+1)^2-2^{2s+1}$ with $m,s\geq 1$ ?

  • Why this could be true:

Bunyakowsky conjecture would imply that the answer is yes for any given $s$.

[ Indeed, the polynomial $4X^2+4X-2^{2s+1}+1$ is irreducible ($\Delta = 2^{2s+5}$), and no integer $d\geq 1$ can divide all values $P(n)$ (since $P(0)$ is odd and $P(1)-P(0)=8$) ]

Unfortunately, as the Wikipedia page indicates, Bunyakowsky conjecture is not known to hold for a single polynomial of degree $\geq 2$.

My hope is that allowing $s$ to assume infinitely many values can help ...

  • Why this could be hard:

As was pointed out by Mike Benett in this MO question, the density of primes of this form among primes that are congruent to $1$ mod $8$ is asymptotically $0$. (As an example, there are $20453$ primes $p<2^{20}$ that are congruent to $1$ mod. $8$, and only $1334$ among them that have the required form, so that the density up to that bound is only $0.065$).

edited tags
Link
GH from MO
  • 105.2k
  • 8
  • 292
  • 398
replaced MathJax used for formatting
Source Link
user9072
user9072

The question is the following :

$\blacktriangleright$ Question:

  • Question:

Does there exist infinitely many primes of the form $(2m+1)^2-2^{2s+1}$ with $m,s\geq 1$ ?

$\blacktriangleright$ Why this could be true:

  • Why this could be true:

Bunyakowsky conjecture would imply that the answer is yes for any given $s$.

[ Indeed, the polynomial $4X^2+4X-2^{2s+1}+1$ is irreducible ($\Delta = 2^{2s+5}$), and no integer $d\geq 1$ can divide all values $P(n)$ (since $P(0)$ is odd and $P(1)-P(0)=8$) ]

Unfortunately, as the Wikipedia page indicates, Bunyakowsky conjecture is not known to hold for a single polynomial of degree $\geq 2$.

My hope is that allowing $s$ to assume infinitely many values can help ...

$\blacktriangleright$ Why this could be hard:

  • Why this could be hard:

As was pointed out by Mike Benett in this MO question, the density of primes of this form among primes that are congruent to $1$ mod $8$ is asymptotically $0$. (As an example, there are $20453$ primes $p<2^{20}$ that are congruent to $1$ mod. $8$, and only $1334$ among them that have the required form, so that the density up to that bound is only $0.065$).

The question is the following :

$\blacktriangleright$ Question:

Does there exist infinitely many primes of the form $(2m+1)^2-2^{2s+1}$ with $m,s\geq 1$ ?

$\blacktriangleright$ Why this could be true:

Bunyakowsky conjecture would imply that the answer is yes for any given $s$.

[ Indeed, the polynomial $4X^2+4X-2^{2s+1}+1$ is irreducible ($\Delta = 2^{2s+5}$), and no integer $d\geq 1$ can divide all values $P(n)$ (since $P(0)$ is odd and $P(1)-P(0)=8$) ]

Unfortunately, as the Wikipedia page indicates, Bunyakowsky conjecture is not known to hold for a single polynomial of degree $\geq 2$.

My hope is that allowing $s$ to assume infinitely many values can help ...

$\blacktriangleright$ Why this could be hard:

As was pointed out by Mike Benett in this MO question, the density of primes of this form among primes that are congruent to $1$ mod $8$ is asymptotically $0$. (As an example, there are $20453$ primes $p<2^{20}$ that are congruent to $1$ mod. $8$, and only $1334$ among them that have the required form, so that the density up to that bound is only $0.065$).

The question is the following :

  • Question:

Does there exist infinitely many primes of the form $(2m+1)^2-2^{2s+1}$ with $m,s\geq 1$ ?

  • Why this could be true:

Bunyakowsky conjecture would imply that the answer is yes for any given $s$.

[ Indeed, the polynomial $4X^2+4X-2^{2s+1}+1$ is irreducible ($\Delta = 2^{2s+5}$), and no integer $d\geq 1$ can divide all values $P(n)$ (since $P(0)$ is odd and $P(1)-P(0)=8$) ]

Unfortunately, as the Wikipedia page indicates, Bunyakowsky conjecture is not known to hold for a single polynomial of degree $\geq 2$.

My hope is that allowing $s$ to assume infinitely many values can help ...

  • Why this could be hard:

As was pointed out by Mike Benett in this MO question, the density of primes of this form among primes that are congruent to $1$ mod $8$ is asymptotically $0$. (As an example, there are $20453$ primes $p<2^{20}$ that are congruent to $1$ mod. $8$, and only $1334$ among them that have the required form, so that the density up to that bound is only $0.065$).

Source Link
few_reps
  • 2k
  • 14
  • 23
Loading