Skip to main navigation Skip to search Skip to main content

ELEMENTARY PROOFS OF TWO CONGRUENCES FOR PARTITIONS WITH ODD PARTS REPEATED AT MOST TWICE

Research output: Contribution to journalArticlepeer-review

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, a(4n + 2) ≡ 0 (mod 2), and a(4n + 3) ≡ 0 (mod 2). 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.

Original languageEnglish (US)
Pages (from-to)85-92
Number of pages8
JournalMathematics Student
Volume94
Issue number3-4
StatePublished - Jul 1 2025

Bibliographical note

Publisher Copyright:
© Indian Mathematical Society, 2025.

Keywords

  • congruences
  • dissections
  • generating functions
  • partitions

Fingerprint

Dive into the research topics of 'ELEMENTARY PROOFS OF TWO CONGRUENCES FOR PARTITIONS WITH ODD PARTS REPEATED AT MOST TWICE'. Together they form a unique fingerprint.

Cite this