Michael Hirschhorn证明Ramanujan型同余式的惊人算法的推广与实现
Generalizing and Implementing Michael Hirschhorn's Amazing Algorithm for Proving Ramanujan-Type Congruences
摘要：
当Mike Hirschhorn向我们展示他可爱的宝石时，它给出了Ramanujan著名结果的最简单的最新证明，即p（11n+6）可被11整除，我们意识到他的惊人方法可以扩展，并教授给计算机，并且可以证明更深层次的身份。如果不是Silviu Radu的强大算法的存在，我们会做得更多，该算法可以处理任何模形式的任何Ramanujan型同余（非常一般的类型），但仍然很高兴知道，为了证明这种简单陈述的结果，可以向一个七岁的孩子解释，人们不需要令人生畏的“模块化网络”，拉马努金从未掌握，可能也不会喜欢
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
