1
$\begingroup$

Does the sum of reciprocals of terms of A086005 converge?

$\endgroup$
5
  • 4
    $\begingroup$ Since one can ask an infinite number of such questions, what makes this one particularly likely, unlikely, or otherwise interesting? $\endgroup$
    – LSpice
    Commented Aug 3, 2022 at 20:49
  • 1
    $\begingroup$ I assume it’s supposed to be interesting because it involves the asymptotic growth of somewhat niche (at least to me) number theoretic quantity $\endgroup$ Commented Aug 3, 2022 at 21:02
  • 2
    $\begingroup$ Please provide motivation/background for your question. Also, it's worth to make the question self-contained. $\endgroup$ Commented Aug 3, 2022 at 21:20
  • $\begingroup$ It's most certainly open. I believe it is open whether there are infinitely many primes $p$ with at least one of $2p-1,2p+1$ semiprime, let alone both. $\endgroup$
    – Wojowu
    Commented Aug 4, 2022 at 5:43
  • 1
    $\begingroup$ The number of semiprimes up to $x$ is asymptotic to $x \log \log x \, / \log x$. So we expect that the number of $n<x$ such that both $n$ and $n+1$ are semiprime (OEIS A070552) is asymptotic to some multiple of $x (\log \log x \,/ \log x)^2$, and one can probably use some sieve method to prove that $C x (\log \log x \,/ \log x)^2$ is an upper bound for some constant $C$. This would already be enough to prove that the sum of the reciprocals of sequence A070552 converges, which would imply that a fortiori the same is true of the subsequence A086005. $\endgroup$ Commented Aug 4, 2022 at 5:45

2 Answers 2

5
$\begingroup$

The sum does converge. We will follow the suggestion of Professor Elkies stated in the comments. Note that the number $k$ is ''sandwiched'' between two semiprimes iff $k=2p$ and $2p\pm 1$ are semiprimes. Let us estimate the number of such primes $p\leq X$, where $X\to +\infty$. Here we will use only two conditions: primality of $p$ and semiprimality of $2p+1$. Using semiprimality of $2p-1$ one can arrive at sharper estimates. Since $2p+1$ is semiprime, it has a form $2p+1=qr$, where $q$ and $r$ are primes. We will assume that $q\leq r$. In particular, $q\leq \sqrt{2X+1}$. For a given prime $q$, let us estimate the number of prime $p\leq X$ with $2p+1=qr$, where $r$ is also prime.

Clearly, $r$ is odd. Let $r=2s+1$, then $s\leq X/q$ and $p=qs+(q-1)/2$. If $s\geq X^{1/6}$, then both $2s+1$ and $qs+(q-1)/2$ must be coprime to all primes $\ell\leq X^{1/6}$. For $\ell\neq 2,q$ this means that $s$ should avoid two residue classes $\mod \ell$. For $\ell=2$ or $q$ we get a single prohibited residue class instead. By standard sieve methods (see, for instance, Fundamental lemma of sieve theory), we see that the number $A(q)$ of such $s\leq X/q$ is $$ A(q)\ll X^{1/6}+\frac{X}{q}\prod_{\ell\neq 2,q, \ell\leq X^{1/6}}\left(1-\frac{2}{\ell}\right)\left(1-\frac{1}{q}\right)\left(1-\frac12\right)\ll \frac{X}{q\ln^2 X}+X^{1/6} $$ Summing over $q\leq \sqrt{2X+1}$, we see that the total number of $s$ (and hence of $p\leq X$) is bounded by $$ \sum_{q\leq \sqrt{2X+1}}\left(\frac{X}{q\ln^2 X}+X^{1/6}\right)\ll \frac{X\ln\ln X}{\ln^2 X}. $$ This is certainly enough, since this gives for all $N$ $$ \sum_{\substack{k\in \text{A086006}\\ 2^N<k\leq 2^{N+1}}}1/k\ll \frac{\ln N}{N^2} $$ and we get a convergent series. Adding the semiprimality of $2p-1$, one can get $\frac{X(\ln\ln X)^2}{\ln^3 X}$ instead. This order of growth is probably accurate.

$\endgroup$
3
$\begingroup$

This sequence, say $(a_1,a_2,\dots)$, is the increasing enumeration of the set (say $S$) of natural numbers $k$ such that each of the numbers $k-1,k,k+1$ is semiprime. So, the problem seems to be of the same flavor as the twin prime conjecture.

Here is the graph $\{(n,\frac{n\,\ln n\,\ln\ln n}{a_n})\colon n=2,3,\dots,\ a_n\le10^6\}$:

enter image description here

This graph suggests that $a_n\asymp n\,\ln n\,\ln\ln n$ and hence $\sum_n\frac1{a_n}=\infty$. At least, the graph suggests that $a_n\ge c n\,\ln n\,\ln\ln n$ for some real $c>0$ and all natural $n$, and then the set $S$, of all semiprimes $k$ "sandwiched" between semiprimes $k-1$ and $k+1$, would be infinite.

So, it seems unclear if this problem is easier than the twin prime conjecture.

$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .