arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2607.07638math.NTmath.CO

一个关于素数模的奇特同余式

A new kind of numbers and related congruences

Zhi-Wei Sun

AI总结:

研究整数\(l>0\)、\(m\geqslant0\)相关的数\(S_l^{(m)}(n)\),通过证明得出特定素数模下的同余式,尤其当\(l = 4\)、\(m = 2\)时得到关于\(Domb\)数\(D(n)\)的奇特素数模同余式。

AI中文摘要:

对于整数\(l>0\)和\(m\geqslant0\),引入数\(S_l^{(m)}(n)=\sum_{k_1,\ldots,k_l\in\mathbb N\atop k_1+\cdots+k_l=n}\binom n{k_1,\ldots,k_l}^m\)。证明对于不整除\(l + 1\)的素数\(p\),有\(\sum_{n=1}^{p - 1}\frac{(-1)^{mn}}{n^{m - 1}}S_l^{(m)}(n)\equiv0\pmod p\)。当\(l = 4\),\(m = 2\)时,得到对于\(p\neq5\)的奇特同余式\(\sum_{n=1}^{p - 1}\frac{D(n)}n\equiv0\pmod p\),其中\(D(n)=\sum_{k=0}^n\binom nk^2\binom{2k}k\binom{2(n - k)}{n - k}\)。

英文摘要:

For integers $l>0$ and $m\geqslant0$, we introduce the numbers $$S_l^{(m)}(n) = \sum_{k_1,\ldots,k_l\in\mathbb N\atop k_1+\cdots+k_l = n} \binom n{k_1,\ldots,k_l}^m \ \ (n=0,1,2,\ldots),$$ and prove that for any prime $p$ not dividing $l+1$ we have the congruence $$\sum_{n=1}^{p-1}\frac{(-1)^{mn}}{n^{m-1}}S_l^{(m)}(n)\equiv0\pmod p.$$ We also obtain a $q$-analogue of this result. For the Domb numbers given by $$D(n)=\sum_{k=0}^n\binom nk^2\binom{2k}k\binom{2(n-k)}{n-k}=S_4^{(2)}(n)\ \ (n=0,1,2,\ldots),$$ we confirm a previous conjecture which states that $$\sum_{n=1}^{p-1}\frac{D(n)}n\equiv\left(\frac p3\right)\frac 25pB_{p-2}\left(\frac13\right)\pmod{p^2}$$ for any prime $p$, where $(\frac p3)$ is the Legendre symbol, and $B_{p-2}(x)$ is the Bernoulli polynomial of degree $p-2$.

补充信息

↑