Bijections and congruences for generalizations of partition identities of Euler and Guy (Q1883657)

Summary: In 1958, Richard Guy proved that the number of partitions of \(n\) into odd parts greater than one equals the number of partitions of \(n\) into distinct parts with no powers of 2 allowed, which is closely related to Euler's famous theorem that the number of partitions of \(n\) into odd parts equals the number of partitions of \(n\) into distinct parts. We consider extensions of Guy's result, which naturally lead to a new algorithm for producing bijections between various equivalent partition ideals of order 1, as well as to two now infinite families of parity results which follow from Euler's pentagonal number theorem and a well-known series-product identity of Jacobi.