Parity of 3-regular partition numbers and Diophantine equations

Abstract

Let b3(n) be the number of 3-regular partitions of n. Recently, W. J. Keith and F. Zanello discovered infinite families of Ramanujan type congruences modulo 2 for b3(2n) involving every prime p with p 13, 17, 19, 23 24, and O. X. M. Yao provided new infinite families of Ramanujan type congruences modulo 2 for b3(2n) involving every prime p≥slant 5. In this paper, we introduce new infinite Ramanujan type congruences modulo 2 for b3(2n). They complement naturally the results of Keith-Zanello and Yao and involve primes in P=\p prime : ∃ \, j∈ \1,4,8\,\, x, y ∈ Z,\, (x,y)=1 with x2+216y2=jp\ whose Dirichlet density is 1/6. As a key ingredient in our proof we show that of the number of primitive solutions for x2+216y2=pm, p ∈ P, p m and pm 124, is divisible by 8. Here, the difficulty arises from the fact that 216 is not idoneal. We also give a conjectural exact formula for the number of solutions for this Diophantine equation. In the second part of the article, we study reversals of Euler-type identities. These are motivated by recent work of the second author on a reversal of Schur's identity which involves 3-regular partitions weighted by the parity of their length.

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…