Elementary Proofs of Two Congruences for Partitions with Odd Parts Repeated at Most Twice

Abstract

In a recent article on overpartitions, Merca considered the auxiliary function a(n) which counts the number of partitions of n where odd parts are repeated at most twice (and there are no restrictions on the even parts). In the course of his work, Merca proved the following: For all n≥ 0, align* a(4n+2) & 0 2, \ \ and \\ a(4n+3) & 0 2. align* Merca then indicates that a classical proof of these congruences would be very interesting. The goal of this short note is to fulfill Merca's request by providing two truly elementary (classical) proofs of these congruences.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…