Let a(n) be the number of partitions of n such that the set of even parts has exactly one element, b(n) be the difference between the number of parts in all odd partitions of n and the number of parts in all distinct partitions of n, and c(n) be the number of partitions of n in which exactly one part is repeated. Beck conjectured that a(n) = b(n) and Andrews, using generating functions, proved that a(n) = b(n) = c(n). We give a combinatorial proof of Andrews' result. Our proof relies on bijections between a set and a multiset, where the partitions in the multiset are decorated with bit strings. We prove combinatorially Beck's second identity, which was also proved by Andrews using generating functions. Let c1(n) be the number of partitions of n such that there is exactly one part occurring three times while all other parts occur only once and let b1(n) to be the difference between the total number of parts in the partitions of n into distinct parts and the total number of different parts in the partitions of n into odd parts. Then, c1(n) = b1(n).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.