Some conjectural continued fractions
Thomas Baruchel

TL;DR
This paper presents several conjectural continued fractions discovered through computational algorithms, contributing new potential formulas to the mathematical literature.
Contribution
It introduces multiple conjectural continued fractions identified via algorithms, expanding the set of known continued fraction representations.
Findings
Several conjectural continued fractions are proposed.
Algorithms effectively identified new continued fractions.
The conjectures invite further mathematical proof.
Abstract
Several conjectural continued fractions found with the help of various algorithms are published in this paper.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Mathematical Dynamics and Fractals · Mathematics and Applications
Some conjectural continued fractions
Thomas Baruchel [email protected]
Method and notation
All results presented below have been found by experimental means. Millions of random continued fractions have been computed at very high speed (code was written in C and double-precision floating numbers were used for the greatest part of the computation despite their relatively low precision). Relations were detected by matching values against various databases with a fast implementation of the famous PSLQ algorithm. Of course, all expressions have been later checked with a much higher precision, but they are not proved and they are copied here as mere conjectures.
Several databases of interesting constants were used; one of them was built from the book of Michael Shamos. Later ad hoc databases were built in order to focus more accurately on specifical constants.
For convenience reasons, the notation being used below for the generalized continued fractions is the old one used by Gauss: . It has to be remembered however that the expression at the right of the operator is not a complete fraction that could be cancelled down.
[TABLE]
1 A continued fraction involving
A continued fraction for the quotient involving simple polynomial functions was conjectured to exist and therefore an algorithm was written for gathering as many constants related to the function as possible. Many identities were detected for particular values and a general expression was found:
[TABLE]
2 An identity involving the lemniscate constant
By looking for values related to the lemniscate constant in randomly generated continued fractions made of integer terms, a general expression could be found:
[TABLE]
where the case here covers the case in the previous formula (1).
3 A functional relation involving self powers
The function is defined as a generalized continued fraction
[TABLE]
then the following relation stands:
[TABLE]
where B is the beta function.
An easy case occurs when , which leads to . Then, choosing (the golden ratio) gives the nice identity:
[TABLE]
while choosing gives:
[TABLE]
and similarly for other constants like , , , etc. The general expression coming from this case being:
[TABLE]
Building a similar identity relying on is not very difficult, but the resulting expression is not as simple as previously:
[TABLE]
4 A continued fraction for
While trying to detect miscellaneous constants by building continued fractions with simple polynomials, several different values related to the hyperbolic tangent function were detected. Generalizing happened to be very easy and the resulting continued fraction seems to be different from the usual one:
[TABLE]
Convergence is slower however than the classical continued fraction for . On the other hand, this version produces nice and simple continued fractions when used with multiples of .
5 A continued fraction for a sum of products
Though Euler’s continued fraction formula gives an easy continued fraction for the following sum of products, the continued fraction below seems to have a quicker convergence:
[TABLE]
Interesting values occur for several values of :
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BA 1991] D. H. Bailey and H. R. P. Ferguson, A polynomial time, numerically stable integer relation algorithm , SRC Technical Report SRC-TR-92-066; RNR Technical Report RNR-91-032 (16 December 1991; 14 July 1992), 1–14.
- 2[BA 1999] D. H. Bailey, H. R. P. Ferguson and S. Arno, Analysis of PSLQ, an integer relation finding algorithm , Mathematics of Computation, vol. 68, 351–369, 1999.
- 3[SH 2001] M. Shamos, Catalogue of the real numbers , 2011; available online at http://euro.ecom.cmu.edu/shamos.html .
