Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 18 Sep 2024 in math.NT | (2409.12321v1)

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\geq 0$, \begin{align*} a(4n+2) &\equiv 0 \pmod{2}, \textrm{\ \ and} \ a(4n+3) &\equiv 0 \pmod{2}. \end{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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.