The Ramanujan Machine: Automatically Generated Conjectures on Fundamental Constants

Code

• github.com/AnonGit90210/RamanujanMachine
  OfficialIn papernone★ 0
• github.com/chriscow/ramanujan-machine
  none★ 0
• github.com/Omega97/Ramanujan_Machine
  none★ 0
• github.com/djptek/eCalculator
  none★ 0

Abstract

Fundamental mathematical constants like e and are ubiquitous in diverse fields of science, from abstract mathematics to physics, biology and chemistry. For centuries, new formulas relating fundamental constants have been scarce and usually discovered sporadically. Here we propose a novel and systematic approach that leverages algorithms for deriving mathematical formulas for fundamental constants and help reveal their underlying structure. Our algorithms find dozens of well-known as well as previously unknown continued fraction representations of , e, Catalan's constant, and values of the Riemann zeta function. Two example conjectures found by our algorithm and so far unproven are: equation* 24 ^2 = 2 + 7 0 1+ 8 1^42 + 7 1 2 + 8 2^42 + 7 2 3 + 8 3^42 + 7 3 4 + 8 4^4.. , 87 (3) = 1 1 - 1^63 7 - 2^65 19 - 3^67 37 - 4^6.. equation* We present two algorithms that proved useful in finding conjectures: a Meet-In-The-Middle (MITM) algorithm and a Gradient Descent (GD) tailored to the recurrent structure of continued fractions. Both algorithms are based on matching numerical values and thus they conjecture formulas without providing proofs and without requiring prior knowledge on any underlying mathematical structure. This approach is especially attractive for constants for which no mathematical structure is known, as it reverses the conventional approach of sequential logic in formal proofs. Instead, our work supports a different approach for research: algorithms utilizing numerical data to unveil mathematical structures, thus trying to play the role of intuition of great mathematicians of the past, providing leads to new mathematical research.

Tasks

Reproductions