This is the sum,

$$e'=\sum_{n=1}^\infty \frac{1}{F_{n}!}$$ where $F_{n}$ is the $n^{th}$ Fibonacci number.

Is it possible to prove that it will converge to a transcendental number?

Edit: Proof of irrationality-:

But first some lemmas,

  1. $F_q\geq q \,\,\,\,$ $\forall q\geq5$

  2. If $P_n$ represents the partial sums of $e'$, then $e'>P_n$ $\forall n\in\mathbb N$

  3. If $e'=\frac{a}{b}$ for some $a,b\in\mathbb N$ , then $b>4$.

    Reason: Obviously $b=1$ is not possible. If $b=2$, then $a=5$ or $a=6$ are the only possibilities. However, in both we get $e'=2.5$ and $e'=3$ respectively, which is again not possible, since adding after 3 terms makes $e'>2.5$ and $e'<3$ because $e'<e$. Similarly, we can also prove that $b\neq 3$ and $b\neq4$.

    $\therefore b\geq5$

  4. Now we just need one more inequality before the main proof. Namely $e'-P_q<\frac{1}{F_q!} \forall q>4$

Reason: Recall that $$\sum_{k=n+1}^{\infty}\frac{1}{k!}<\frac{1}{n!}\;\;\;\forall n\geq1$$

also $e'-P_q=\frac{1}{F_{q+1}!}+\frac{1}{F_{q+2}!}+\cdots$

$\therefore$ from (1), $$e'-P_q<\frac{1}{F_{q}!}\;\;\;\forall q\geq5$$ (Actually this is true for all $q\geq2$

Now, the main proof.

Theorem. $e'$ is irrational

Proof. Assume $\exists p,q \; \in \mathbb N$ such that $e'=\frac{p}{q}$, where $gcd(p,q)=1$

then $q\geq5$ and $\frac{p}{q}-P_q<\frac{1}{F_{q}!}$

Now, $\left(\frac{p}{q}-P_q\right)=\left(\frac{p}{q}-P_q\right)\frac{F_{q}!}{F_{q}!}$



where $C\in\mathbb Z$

however, from inequality (4), we know that $\frac{C}{F_{q}!}<\frac{1}{F_{q}!}$, which implies that $C\leq0$,

but then $\frac{p}{q}-P_q\leq0$, which contradicts (2).

hence, by contradiction $e'$ is irrational.

(Please let me know if there is any mistake)

  • 81
  • 2
  • I think chances are not bad that this is a Liouville-number. But first of all , we have to prove that it is irrational. – Peter Jan 10 '21 at 12:13
  • 2
    Please show some research effort yourself first, then we will be happy to help :~) – Aatmaj Jan 10 '21 at 12:14
  • 1
    I suggest to start with $$\sum _{n=1}^{\infty } \frac{1}{F_n}$$ – Raffaele Jan 10 '21 at 13:56
  • https://oeis.org/A327558 – Aatmaj Jan 10 '21 at 15:04
  • Where is the question from? – Aatmaj Jan 10 '21 at 15:06
  • Proving transcendence is always difficult, but I think we can definitely prove it is irrational. – K.defaoite Jan 10 '21 at 17:46
  • @K.defaoite You are right, we can definitely prove it is irrational. I had constructed a proof a few months back but had forgotten to note it down. It took me a while to reconstruct it. I will be editing the question in some time to add the proof. – LMS Jan 11 '21 at 04:34
  • @Peter I don't think it's so easy to show that this is a Liouville number. I was originally in agreement with you there, but if I've done my math right, Stirling's approximation gives that $F_{n+1}!\in o\left((F_n!)^c\right)$ for any $c\gt\phi$, so you can't even easily bound the difference between the partial sum through $(F_n!)^{-1}$ and the total sum by $(F_n!)^{-2}$. – Steven Stadnicki Jan 11 '21 at 17:59
  • @StevenStadnicki I have not claimed it is easy, but it looks like it is one. I cannot judge whether the posted irrationality proof is correct. – Peter Jan 12 '21 at 14:11

0 Answers0