Extensions of the truncated pentagonal number theorem

Abstract

Andrews and Merca introduced and proved a q-series expansion for the partial sums of the q-series in Euler's pentagonal number theorem. Kolitsch, in 2022, introduced a generalization of the Andrews-Merca identity via a finite sum expression for Σn ≥ k q (k + m) n ( q; q )n [ smallmatrix n - 1 \\ k - 1 smallmatrix ]q for positive integers m, and Yao also proved an equivalent evaluation for this q-series in 2022, and Schlosser and Zhou extended this result for complex values m in 2024, with the m = 1 case yielding the Andrews-Merca identity, and with the m = 2 case having been proved separately by Xia, Yee, and Zhao. We introduce and apply a method, based on the q-version of Zeilberger's algorithm, that may be used to obtain finite sum expansions for q-series of the form Σn ≥ 1 q p(k) n ( q; q )n + 2 [ smallmatrix n - 1 \\ k - 1 smallmatrix ]q for linear polynomials p(k) and 1 ∈ N and 2 ∈ N0, thereby generalizing the Andrews-Merca identity and the Kolitsch, Yao, and Schlosser-Zhou identities. For example, the (p(k), 1, 2) = (k+1, 2, 0) case provides a new truncation identity for Euler's pentagonal number theorem.

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…