On the number of partitions into parts not congruent to 0, 312

DOI10.1007/S10998-020-00374-7MaRDI QIDQ2052779zbMATH OpenOpenAlexWikidataFDO

Authors Mircea Merca

Publication date 27 November 2021

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10998-020-00374-7

zbMATH Keywords

integer partitionspartition congruencestriangular numbers

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Partitions; congruences and congruential restrictions (11P83)

Review text

Let \(R(n)\) denote the number of partitions of the positive integer \(n\) into parts not congruent to \(0, \pm 3\pmod{12}\). \textit{A. V. Sills} [Ramanujan J. 23, 253--264 (2010; Zbl 1211.11112)] gave a Rademacher-type formula for \(R(n)\). Computing \(R(n)\) by this formula requires arithmetic with very high-precision approximate real numbers. As to details on how to efficiently implement a Rademacher-type formula see \textit{F. Johansson} [LMS J. Comput. Math. 15, 341--359 (2012; Zbl 1344.11089)].\par In the paper under review the author investigates other relations for computing the value of \(R(n)\). His Theorem 2.1 yields Corollary 2.2 which is a linear recurrence relation for \(R(n)\) involving the generalized pentagonal numbers. Theorem 3.1 yields Corollary 3.2, the following more efficient recurrence relation for computing \(R(n)\): For \(n\ge 0\), \[R(n)+2\sum_{j=1}^{\infty}(-1)^j R(n-2j^2)=\begin{cases} 1, \;\text{if}\; n=k(3k-2)\\0, \;\text{otherwise.}\end{cases}\] The author also derives that \(R(n)\) is odd if and only if \(3n+1\) is a square. According to the proof of Corollary 5.1, \[R(n)=\sum_{k=0}^{\infty}(-1)^{k(k+1)/2}p(n-3k(k+1)/2)\] with the ordinary partition function \(p(n)\), therefore, for \(n\ge 0\), \[\sum_{8k+1\; \text{square}}p(n-3k)\equiv 1 \bmod 2 \] if and only if \(3n+1\) is a square.

Recommendations

• On the number of partitions into odd parts or congruent to \(\pm 2 \pmod{10}\)
• On partitions into parts r(mod m)
• Recurrences for the partition function and its relatives
• From a Rogers's identity to overpartitions
• Congruences like Ramanujan's for powers of the partition function

Cites work

• A general method for proving the non-trivial linear homogeneous partition inequalities
• Efficient implementation of the Hardy-Ramanujan-Rademacher formula
• Fast algorithm for generating ascending compositions
• From a Rogers's identity to overpartitions
• Further Identities of the Rogers-Ramanujan Type
• scientific article; zbMATH DE number 2126631 (Why is no real title available?)
• scientific article; zbMATH DE number 1222942 (Why is no real title available?)
• On the expansion of the partition functions in a series
• Overpartitions
• Parity of sums of partition numbers and squares in arithmetic progressions
• Rademacher-type formulas for restricted partition and overpartition functions
• The truncated pentagonal number theorem
• Truncated theta series and a problem of Guo and Zeng

Cited in

(7)

• A reversal of Schur's partition theorem
• A further look at cubic partitions
• On partitions into parts r(mod m)
• On the number of partitions into odd parts or congruent to \(\pm 2 \pmod{10}\)
• 6-regular partitions: new combinatorial properties, congruences, and linear inequalities
• Positivity and tails of pentagonal number series
• \(s\)-modular, \(s\)-congruent and \(s\)-duplicate partitions

This page was built for publication: On the number of partitions into parts not congruent to \(0, \pm 3\pmod{12}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052779)