Skip to main content
+top level tag (nt) and minor latex edits
Source Link
Myshkin
  • 17.6k
  • 5
  • 71
  • 137

Let $\Pi$ be the twin prime constant and $\pi_2(n)$ the twin prime counting function.

Define

$$ t(n) = | \pi_2(n) - 2 \Pi \int_2^n \frac{dx}{\ln(x)^2} | $$$$ t(n) = \left| \pi_2(n) - 2 \Pi \int_2^n \frac{dx}{\ln(x)^2} \right| $$

Is it consistent with current data that for $n > 100 $ we have :

$$ t(n) < \ln(n+2)^2 \sqrt (n+2) $$$$ t(n) < \ln(n+2)^2 \sqrt {(n+2)} $$

??

Is there a stronger plausible boundary for $t(n)$ ?

Let $\Pi$ be the twin prime constant and $\pi_2(n)$ the twin prime counting function.

Define

$$ t(n) = | \pi_2(n) - 2 \Pi \int_2^n \frac{dx}{\ln(x)^2} | $$

Is it consistent with current data that for $n > 100 $ we have :

$$ t(n) < \ln(n+2)^2 \sqrt (n+2) $$

??

Is there a stronger plausible boundary for $t(n)$ ?

Let $\Pi$ be the twin prime constant and $\pi_2(n)$ the twin prime counting function.

Define

$$ t(n) = \left| \pi_2(n) - 2 \Pi \int_2^n \frac{dx}{\ln(x)^2} \right| $$

Is it consistent with current data that for $n > 100 $ we have :

$$ t(n) < \ln(n+2)^2 \sqrt {(n+2)} $$

??

Is there a stronger plausible boundary for $t(n)$ ?

Let $\Pi$ be the twin prime twins constant and $\pi_2(n)$ the prime twin prime counting function.

Define

$$ t(n) = | \pi_2(n) - 2 \Pi \int_2^n \frac{dx}{\ln(x)^2} | $$

Is it consistent with current data that for $n > 100 $ we have :

$$ t(n) < \ln(n+2)^2 \sqrt (n+2) $$

??

Is there a stronger plausible boundary for $t(n)$ ?

Let $\Pi$ be the prime twins constant and $\pi_2(n)$ the prime twin counting function.

Define

$$ t(n) = | \pi_2(n) - 2 \Pi \int_2^n \frac{dx}{\ln(x)^2} | $$

Is it consistent with current data that for $n > 100 $ we have :

$$ t(n) < \ln(n+2)^2 \sqrt (n+2) $$

??

Is there a stronger plausible boundary for $t(n)$ ?

Let $\Pi$ be the twin prime constant and $\pi_2(n)$ the twin prime counting function.

Define

$$ t(n) = | \pi_2(n) - 2 \Pi \int_2^n \frac{dx}{\ln(x)^2} | $$

Is it consistent with current data that for $n > 100 $ we have :

$$ t(n) < \ln(n+2)^2 \sqrt (n+2) $$

??

Is there a stronger plausible boundary for $t(n)$ ?

added 3 characters in body
Source Link
mick
  • 769
  • 3
  • 19

Let $\Pi$ be the prime twins constant and $\pi_2(n)$ the prime twin counting function.

Define

$$ t(n) = | \pi_2(n) - 2 \Pi \int_2^n \frac{dx}{\ln(x)^2} | $$

Is it consistent with current data that for $n > 100$$n > 100 $ we have :

$$ t(n) < \ln(n+2)^2 \sqrt (n+2) $$

??

Is there a stronger plausible boundary for $t(n)$ ?

Let $\Pi$ be the prime twins constant and $\pi_2(n)$ the prime twin counting function.

Define

$$ t(n) = | \pi_2(n) - 2 \Pi \int_2^n \frac{dx}{\ln(x)^2} | $$

Is it consistent with current data that for $n > 100$ we have :

$$ t(n) < \ln(n+2)^2 \sqrt (n+2) $$

??

Is there a stronger plausible boundary for $t(n)$ ?

Let $\Pi$ be the prime twins constant and $\pi_2(n)$ the prime twin counting function.

Define

$$ t(n) = | \pi_2(n) - 2 \Pi \int_2^n \frac{dx}{\ln(x)^2} | $$

Is it consistent with current data that for $n > 100 $ we have :

$$ t(n) < \ln(n+2)^2 \sqrt (n+2) $$

??

Is there a stronger plausible boundary for $t(n)$ ?

Source Link
mick
  • 769
  • 3
  • 19
Loading