2000 character limit reached
Arithmetic properties of cubic and overcubic partition pairs
Published 10 Aug 2018 in math.NT | (1808.03487v1)
Abstract: Let $b(n)$ denote the number of cubic partition pairs of $n$. We give affirmative answer to a conjecture of Lin, namely, we prove that $$b(49n+37)\equiv 0 \pmod{49}.$$ We also prove two congruences modulo $256$ satisfied by $\overline{b}(n)$, the number of overcubic partition pairs of $n$. Let $\overline{a}(n)$ denote the number of overcubic partition of $n$. For a fixed positive integer $k$, we further show that $\overline{b}(n)$ and $\overline{a}(n)$ are divisible by $2k$ for almost all $n$. We use arithmetic properties of modular forms to prove our results.
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.