English

Proof of a conjecture involving Sun polynomials

Number Theory 2015-12-29 v2 Combinatorics

Abstract

The Sun polynomials gn(x)g_n(x) are defined by \begin{align*} g_n(x)=\sum_{k=0}^n{n\choose k}^2{2k\choose k}x^k. \end{align*} We prove that, for any positive integer nn, there hold \begin{align*} &\frac{1}{n}\sum_{k=0}^{n-1}(4k+3)g_k(x) \in\mathbb{Z}[x],\quad\text{and}\\ &\sum_{k=0}^{n-1}(8k^2+12k+5)g_k(-1)\equiv 0\pmod{n}. \end{align*} The first one confirms a recent conjecture of Z.-W. Sun, while the second one partially answers another conjecture of Z.-W. Sun. We give three different proofs of the former. One of them depends on the following congruence: (m+n2m1)(nm)(2nn)0(modm+n)for m,n1. {m+n-2\choose m-1}{n\choose m}{2n\choose n}\equiv 0\pmod{m+n}\quad\text{for $m,n\geqslant 1$.}

Keywords

Cite

@article{arxiv.1511.04005,
  title  = {Proof of a conjecture involving Sun polynomials},
  author = {Victor J. W. Guo and Guo-Shuai Mao and Hao Pan},
  journal= {arXiv preprint arXiv:1511.04005},
  year   = {2015}
}

Comments

15 pages

R2 v1 2026-06-22T11:43:50.729Z