中文

Z.-W. Sun 近期一个猜想的证明

数论 2016-04-19 v1 组合数学

摘要

The polynomials dn(x)d_n(x) are defined by \begin{align*} d_n(x) &= \sum_{k=0}^n{n\choose k}{x\choose k}2^k. \end{align*} We prove that, for any prime pp, the following congruences hold modulo pp: \begin{align*} \sum_{k=0}^{p-1}\frac{{2k\choose k}}{4^k} d_k\left(-\frac{1}{4}\right)^2 &\equiv \begin{cases} 2(-1)^{\frac{p-1}{4}}x,&\text{if p=x2+y2p=x^2+y^2 with x1(mod4)x\equiv 1\pmod{4},} 0,&\text{if p3(mod4)p\equiv 3\pmod{4},} \end{cases} [5pt] \sum_{k=0}^{p-1}\frac{{2k\choose k}}{4^k} d_k\left(-\frac{1}{6}\right)^2 &\equiv 0, \quad\text{if p>3p>3,} [5pt] \sum_{k=0}^{p-1}\frac{{2k\choose k}}{4^k} d_k\left(\frac{1}{4}\right)^2 &\equiv \begin{cases} 0,&\text{if p1(mod4)p\equiv 1\pmod{4},} (-1)^{\frac{p+1}{4}}{\frac{p-1}{2}\choose \frac{p-3}{4}},&\text{if p3(mod4)p\equiv 3\pmod{4}.} \end{cases} \sum_{k=0}^{p-1}\frac{{2k\choose k}}{4^k} d_k\left(\frac{1}{6}\right)^2 &\equiv 0, \quad\text{if p>5p>5.} \end{align*} The p3(mod4)p\equiv 3\pmod{4} case of the first one confirms a conjecture of Z.-W. Sun, while the second one confirms a special case of another conjecture of Z.-W. Sun.

关键词

引用

@article{arxiv.1604.05019,
  title  = {Proof of a recent conjecture of Z.-W. Sun},
  author = {Song Guo and Victor J. W. Guo},
  journal= {arXiv preprint arXiv:1604.05019},
  year   = {2016}
}

备注

4 pages