On divisibility of sums of Apery polynomials
classification
🧮 math.NT
math.CO
keywords
alphabinomepsilonaperydivisibilityequiv0integerspmod
read the original abstract
For any positive integers $m$ and $\alpha$, we prove that $$\sum_{k=0}^{n-1}\epsilon^k(2k+1)A_k^{(\alpha)}(x)^m\equiv0\pmod{n}, $$ where $\epsilon\in\{1,-1\}$ and $$ A_n^{(\alpha)}(x)=\sum_{k=0}^n\binom{n}{k}^{\alpha}\binom{n+k}{k}^{\alpha}x^k.$$
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.