Proof and generalization of conjectures of Ramanujan Machine
Abstract
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 Petkovsek's algorithm. Especially, in the former way, we can get strong generalization of 31 conjectures.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.