Generalising a finite version of Euler's partition identity
Combinatorics
2016-12-06 v1
Abstract
Recently, George Andrews has given a Glaisher style proof of a finite version of Euler's partition identity. We generalise this result by giving a finite version of Glaisher's partition identity. Both the generating function and bijective proofs are presented.
Cite
@article{arxiv.1612.00937,
title = {Generalising a finite version of Euler's partition identity},
author = {Darlison Nyirenda},
journal= {arXiv preprint arXiv:1612.00937},
year = {2016}
}
Comments
5 pages, presented at South African Mathematical Society 59th Annual Conference, November 2016