arXiv:2403.09729 [math.CA]AbstractReferencesReviewsResources
Proof and generalization of conjectures of Ramanujan Machine
Published 2024-03-13Version 1
The Ramanujan Machine project predicts new continued fraction representations of numbers expressed by important mathematical constants. Generally, the value of a continued fraction is found by reducing it to a second order linear difference equation. In this paper, we prove 38 conjectures by solving the equation in two ways, use of a differential equation or application of Petkov\v{s}ek's algorithm. Especially, in the former way, we can get strong generalization of 31 conjectures.
Categories: math.CA
Related articles: Most relevant | Search more
arXiv:1908.03333 [math.CA] (Published 2019-08-09)
On Entry II.16.12: A continued fraction of Ramanujan
Some conjectures on addition and multiplication of complex (real) numbers
arXiv:1805.10149 [math.CA] (Published 2018-05-24)
On a generalization of the Rogers generating function