Congruences for sums of Delannoy numbers and polynomials
Abstract
In this paper, we apply the power-partible reduction to study arithmetic properties of sums involving Delannoy numbers Dk and polynomials Dk(z). Let v∈ and p be an odd prime. It is proved that, for any z∈\0,-1\, there exist cv∈ z-v[z] and cv∈ (z+1)-v[z], both free of p and can be determined mechanically, such that equation* Σk=0p-1(2k+1)2vDk(z) cv (-zp) p equation* if (p,z)=1 and equation* Σk=0p-1(-1)k(2k+1)2vDk(z) cv (z+1p) p equation* if (p,z+1)=1. Here (-) denotes the Legendre symbol. When n is a power of 2, we find there exist odd integers v and even integers v, both independent of n and can be determined mechanically, such that \[ Σk=0n-1(2k+1)2v+1Dk v n n3 \] and \[ Σk=0n-1(-1)k(2k+1)2v+1Dk v n2 n3. \] The case v=1 in the last congruence confirms a conjecture of Guo and Zeng in 2012.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.