2000 character limit reached
Congruences for an analogue of Lin's partition function (2510.13685v1)
Published 15 Oct 2025 in math.NT and math.CO
Abstract: We study certain arithmetic properties of an analogue $B(n)$ of Lin's restricted partition function that counts the number of partition triples $\pi=(\pi_1,\pi_2,\pi_3)$ of $n$ such that $\pi_1$ and $\pi_2$ comprise distinct odd parts and $\pi_3$ consists of parts divisible by $4$. With the help of elementary $q$-series techniques and modular functions, we establish Ramanujan-type congruences modulo $2,3,5,7$, and $9$ for certain sums involving $B(n)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.