Papers
Topics
Authors
Recent
Search
2000 character limit reached

Congruences involving generalized central trinomial coefficients

Published 23 Aug 2010 in math.NT and math.CO | (1008.3887v13)

Abstract: For integers $b$ and $c$ the generalized central trinomial coefficient $T_n(b,c)$ denotes the coefficient of $xn$ in the expansion of $(x2+bx+c)n$. Those $T_n=T_n(1,1)\ (n=0,1,2,\ldots)$ are the usual central trinomial coefficients, and $T_n(3,2)$ coincides with the Delannoy number $D_n=\sum_{k=0}n\binom nk\binom{n+k}k$ in combinatorics. We investigate congruences involving generalized central trinomial coefficients systematically. Here are some typical results: For each $n=1,2,3,\ldots$ we have $$\sum_{k=0}{n-1}(2k+1)T_k(b,c)2(b2-4c){n-1-k}\equiv0\pmod{n2}$$ and in particular $n2\mid\sum_{k=0}{n-1}(2k+1)D_k2$; if $p$ is an odd prime then $$\sum_{k=0}{p-1}T_k2\equiv\left(\frac{-1}p\right)\ \pmod{p}\ \ \ {\rm and}\ \ \ \sum_{k=0}{p-1}D_k2\equiv\left(\frac 2p\right)\ \pmod{p},$$ where $(-)$ denotes the Legendre symbol. We also raise several conjectures some of which involve parameters in the representations of primes by certain binary quadratic forms.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.