Short and Easy Computer Proofs of the Rogers-Ramanujan Identities and of Identities of Similar Type

Abstract

New short and easy computer proofs of finite versions of the Rogers-Ramanujan identities and 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.