Papers
Topics
Authors
Recent
Search
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.$$

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.