Congruences involving generalized central trinomial coefficients

From MaRDI portal
(Redirected from Publication:477109)




Abstract: For integers b and c the generalized central trinomial coefficient Tn(b,c) denotes the coefficient of xn in the expansion of (x2+bx+c)n. Those Tn=Tn(1,1)(n=0,1,2,ldots) are the usual central trinomial coefficients, and Tn(3,2) coincides with the Delannoy number 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(b^2-4c)^{n-1-k}equiv0pmod{n^2} and in particular n2midsumk=0n1(2k+1)Dk2; if p is an odd prime then sum_{k=0}^{p-1}T_k^2equivleft(frac{-1}p ight) pmod{p} { m and} sum_{k=0}^{p-1}D_k^2equivleft(frac 2p ight) 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.




Cited in
(44)


Describes a project that uses

Uses Software





This page was built for publication: Congruences involving generalized central trinomial coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477109)