A short and simple proof of Ramanujan's 11 partition congruence
From MaRDI portal
(Redirected from Publication:2017210)
A short and simple proof of Ramanujan's \(\mod 11\) partition congruence
A short and simple proof of Ramanujan's \(\mod 11\) partition congruence
Cites work
- scientific article; zbMATH DE number 4108855 (Why is no real title available?)
- scientific article; zbMATH DE number 1556739 (Why is no real title available?)
- A Birthday Present for Ramanujan
- An elementary proof of p(11m+6)≡0 (mod 11)
- Another elementary proof that \(p(11n+6)\equiv 0\pmod{11}\)
- Cranks and t-cores
- Dyson’s crank of a partition
- Inequalities for the crank
- New Combinatorial Interpretations of Ramanujan's Partition Congruences Mod 5,7 and 11
- Ramanujan's lost notebook. Part III
- Ramanujan's partition congruences
- Sieved Partition Functions and q-Binomial Coefficients
- Some Properties of Partitions
Cited in
(7)- On 3-regular tripartitions
- Ramanujan-style proof of \(p_{-3}(11n+7) \equiv 0 \pmod{11}\)
- An invitation to formal power series
- Ramanujan's congruences for partitions modulo 5, 7 and 11
- Computer-assisted proofs of congruences for multipartitions and divisor function convolutions, based on methods of differential algebra
- Fractional powers of the generating function for the partition function
- Another elementary proof that \(p(11n+6)\equiv 0\pmod{11}\)
This page was built for publication: A short and simple proof of Ramanujan's \(\mod 11\) partition congruence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017210)