A computer proof of a polynomial identity implying a partition theorem of Göllnitz (Q696795)

Let a partition of the natural number \(n\) into distinct parts be given by \(n=n_1+n_2+ \cdots+n_r\) where the \(n_i\) are listed in decreasing order. Let \(A(n)\) denote the number of such partitions where (i) \(n_i\neq 1\), 3 for all \(i\); (ii) \(n_i-n_{i+1} \geq 6\) for all \(i\), with strict inequality if \(n_i\equiv 0,1,3\pmod 6\) for all \(i\). Let \(B(n)\) denote the number of such partitions, where \(n_i\equiv 2,4,5\pmod 6\) for all \(i\). A theorem obtained by \textit{H. Göllnitz} [J. Reine Angew. Math. 225, 154-190 (1967; Zbl 0166.00803)] states that \(A(n)=B(n)\). More recently, Alladi, Andrews, and Gordon gave a proof of Göllnitz's theorem based on colored partitions. In this paper, the authors use a Mathematica package called qMultiSum (written by the second author) in order to derive a complicated identity regarding \(q\)-binomial coefficients that generalizes Göllnitz's theorem. Six of the sixteen pages of this paper are devoted to the workings of qMultiSum. The paper concludes with computer proofs of finite analogues of well-known identities of Jacobi and Euler.