Generalizing and Implementing Michael Hirschhorn's Amazing Algorithm for Proving Ramanujan-Type Congruences

Publication date: 27 June 2013

Abstract: When Mike Hirschhorn showed us his lovely gem, that gives the simplest-to-date proof of Ramanujan's famous result that p(11n+6) is divisible by 11, we realized that his amazing method can be extended, and taught to a computer, and can prove even deeper identities. We would have done much more if not for the existence of Silviu Radu's powerful algorithm that handle any Ramanujan type congruence for any modular form (of a very general type), but it is still nice to know that in order to prove such simply stated results, that can be explained to a seven-year-old, one does not need the intimidating edifice of the "web of modularity", that Ramanujan never mastered, and probably would not have liked.

This page was built for publication: Generalizing and Implementing Michael Hirschhorn's Amazing Algorithm for Proving Ramanujan-Type Congruences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6242958)