8
$\begingroup$

A well-known result on Egyptian fractions states that any positive rational number can be written as a sum of finitely many distinct unit fractions.

For each prime $p$, let $p'$ be the first prime after $p$. Then $$\{p+p':\ p\ \text{is prime}\}=\{p_k+p_{k+1}:\ k=1,2,3,\ldots\},$$ where $p_n$ denotes the $n$th prime. By the Bertrand Postulate proved by Chebyshev, for any positive integer $k$, we have $p_{k+1}<2p_k$ and hence $2p_k<p_k+p_{k+1}<3p_k$. Thus the series $$\sum_p\frac1{p+p'}=\sum_{k=1}^\infty\frac1{p_k+p_{k+1}}$$ diverges.

Motivated by Question 316474, I make the following conjecture.

Conjecture. For each positive rational number $r$, there is a finite set $S$ of primes such that $$r=\sum_{p\in S}\frac1{p+p'}.$$

Let $r$ be any positive rational number. As the series $\sum_p\frac1{p+p'}$ (with $p$ prime) diverges, there is a unique prime $q$ such that $$\sum_{p<q}\frac{1}{p+p'}\le r<\sum_{p\le q}\frac1{p+p'}.$$ Thus $$0\le r_0:=r-\sum_{p<q}\frac1{p+p'}<\frac1{q+q'}\le\frac1{2+3}=\frac15.$$ If $r_0=\sum_{p\in S}\frac1{p+p'}$ for some finite set $S$ of primes, then all those $p\in S$ are greater than $q$, and $$r=\sum_{p<q}\frac1{p+p'}+\sum_{p\in S}\frac1{p+p'}.$$ Therefore it suffices to consider the conjecture only for $r<1/5$.

Note that \begin{gather*}\frac16=\frac1{3+5}+\frac1{11+13},\ \ \frac18=\frac1{3+5},\\\frac19=\frac1{5+7}+\frac1{17+19},\ \ \frac1{10}=\frac1{5+7}+\frac1{29+31}. \end{gather*} Also, $$\frac14=\frac1{3+5}+\frac1{5+7}+\frac1{11+13}$$ and $$\frac13=\frac1{3+5}+\frac1{5+7}+\frac1{7+11}+\frac1{11+13}+\frac1{17+19}.$$

QUESTION. Any ideas towards solving the conjecture? Can one find an explicit desired representation for $r\in\{1,1/2,1/7,1/11\}$?

Your comments are welcome!

$\endgroup$
11
  • $\begingroup$ See also oeis.org/A001043. $\endgroup$ Commented Nov 3 at 13:29
  • $\begingroup$ IIUC, don't (1/7) = 1/(3+5) + 1/(29+31) + 1/(419+421) and (1/11) = 1/(5+7) + 1/(71+73) + 1/(787+797) = 1/(5+7) + 1/(97+101) + 1/(197+199) work? $\endgroup$ Commented Nov 3 at 13:35
  • $\begingroup$ @DSM Thanks! You may pose the solution for $1/7$ and $1/11$ as an answer. Your data support the conjecture. Can you find a solution for $1/2$? $\endgroup$ Commented Nov 3 at 13:39
  • 2
    $\begingroup$ 1/2 = 1/(2+3) + 1/(3+5) + 1/(5+7) + 1/(7+11) + 1/(13+17) + 1/(179+181) = 1/(2+3) + 1/(3+5) + 1/(5+7) + 1/(7+11) + 1/(17+19) + 1/(59+61) = 1/(2+3) + 1/(3+5) + 1/(5+7) + 1/(11+13) + 1/(13+17) + 1/(29+31) = 1/(2+3) + 1/(3+5) + 1/(5+7) + 1/(7+11) + 1/(13+17) + 1/(179+181) = 1/(2+3) + 1/(3+5) + 1/(5+7) + 1/(7+11) + 1/(13+17) + 1/(193+197) + 1/(2339+2341). $\endgroup$ Commented Nov 3 at 14:07
  • $\begingroup$ @DSM Great! It should be challenging to find a solution for $r=1$. You may have a try! $\endgroup$ Commented Nov 3 at 14:15

1 Answer 1

5
$\begingroup$

For $1/11$, there is \begin{align} \frac{1}{11} &= \frac{1}{5 + 7} + \frac{1}{71 + 73} + \frac{1}{787 + 797} \\ &= \frac{1}{5 + 7} + \frac{1}{97 + 101} + \frac{1}{197 + 199} \end{align}

For $1/7$, we have

\begin{align} \frac{1}{7} =\frac{1}{3+5} + \frac{1}{29+31} + \frac{1}{419+421} \end{align}

For $1/2$,

\begin{align} \frac12 = \frac{1}{2+3} + \frac{1}{3+5} + \frac{1}{5+7} + \frac{1}{7+11} + \frac{1}{13+17} + \frac{1}{179+181} \end{align}

I am still waiting for the result for $r=1$. I used recursion in python, but perhaps a greedy algorithm or some sort of integer program could also work.

$\endgroup$
1
  • 1
    $\begingroup$ For $r=1$ the solution will contain at least $314$ terms and the LCM of the denominators is going to be more than 2900 bits. I aborted my brutish-force searches... $\endgroup$ Commented Nov 4 at 8:19

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.