English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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

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