Short and easy computer proofs of the Rogers-Ramanujan identities and of identities of similar type
Summary: New short and easy computer proofs of finite versions of the Rogers- Ramanujan identities and of identities of similar type are given. These include a very short proof of the first Rogers-Ramanujan identity that was missed by computers, and a new proof of the well-known quintuple product identity by creative telescoping.
scientific article; zbMATH DE number 741551