Generalising a finite version of Euler's partition identity
classification
🧮 math.CO
keywords
finiteidentitypartitionversioneulerglaisherandrewsbijective
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.