2000 character limit reached
New super congruences involving Bernoulli and Euler polynomials
Published 30 May 2016 in math.NT and math.CO | (1605.09179v1)
Abstract: Let $p>3$ be a prime, and let $a$ be a rational p-adic integer with $a\not\equiv 0\pmod p$. In this paper we establish congruences for $$\sum_{k=1}{(p-1)/2}\frac{\binom ak\binom{-1-a}k}k, \quad\sum_{k=0}{(p-1)/2}k\binom ak\binom{-1-a}k \quad\text{and}\quad\sum_{k=0}{(p-1)/2}\frac{\binom ak\binom{-1-a}k}{2k-1}\pmod {p2}$$ in terms of Bernoulli and Euler polynomials. We also give some transformation formulas for congruences modulo $p2$.
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.