2000 character limit reached
On divisibility of sums of Apery polynomials
Published 7 Aug 2011 in math.NT and math.CO | (1108.1546v1)
Abstract: For any positive integers $m$ and $\alpha$, we prove that $$\sum_{k=0}{n-1}\epsilonk(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}xk.$$
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.