Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
143 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Congruences for sums of Delannoy numbers and polynomials (2505.05728v1)

Published 9 May 2025 in math.CO

Abstract: In this paper, we apply the power-partible reduction to study arithmetic properties of sums involving Delannoy numbers $D_k$ and polynomials $D_k(z)$. Let $v\in\bN$ and $p$ be an odd prime. It is proved that, for any $z\in\bZ\setminus{0,-1}$, there exist $c_v\in z{-v}\bZ[z]$ and $\tilde{c}v\in (z+1){-v}\bZ[z]$, both free of $p$ and can be determined mechanically, such that \begin{equation*} \sum{k=0}{p-1}(2k+1){2v}D_k(z)\equiv c_v \left(\frac{-z}{p}\right) \pmod {p} \end{equation*} if $\gcd(p,z)=1$ and \begin{equation*} \sum_{k=0}{p-1}(-1)k(2k+1){2v}D_k(z)\equiv \tilde{c}v \left(\frac{z+1}{p}\right) \pmod {p} \end{equation*} if $\gcd(p,z+1)=1$. Here $(-)$ denotes the Legendre symbol. When $n$ is a power of $2$, we find there exist odd integers $\rho_v$ and even integers $\tilde{\rho}_v$, both independent of $n$ and can be determined mechanically, such that [ \sum{k=0}{n-1}(2k+1){2v+1}D_k\equiv \rho_v n \pmod {n3} ] and [ \sum_{k=0}{n-1}(-1)k(2k+1){2v+1}D_k\equiv \tilde{\rho}_v n2 \pmod {n3}. ] The case $v=1$ in the last congruence confirms a conjecture of Guo and Zeng in 2012.

Summary

We haven't generated a summary for this paper yet.