Subscribe to Events

Abstract: We develop a method for proving automatically Ramanujan series for 1/Pi using modular equations. For the case of alternating series these equations are of a much lower degree than those required in the methods of other authors. For example, it was thought that a complete explicit proof of the Chudnovskys' fastest series for 1/Pi would require a supercomputer. We will show that this is not true

Zoom Link: https://rutgers.zoom.us/j/94346444480
 [password: The 20th Catalan number, alias (40)!/(20!*21!), alias 6564120420 ]