<p>In this paper, we study some supercongruences involving the sequence <Equation ID="Equ24"> <EquationSource Format="TEX">\( t_n(x)=\sum _{k=0}^n\left( {\begin{array}{c}n\\ k\end{array}}\right) \left( {\begin{array}{c}x\\ k\end{array}}\right) \left( {\begin{array}{c}x+k\\ k\end{array}}\right) 2^k \)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <msub> <mi>t</mi> <mi>n</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <munderover> <mo>∑</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mi>n</mi> </munderover> <mfenced close=")" open="("> <mrow> <mtable> <mtr> <mtd> <mi>n</mi> </mtd> </mtr> <mtr> <mtd> <mrow> <mrow /> <mi>k</mi> </mrow> </mtd> </mtr> </mtable> </mrow> </mfenced> <mfenced close=")" open="("> <mrow> <mtable> <mtr> <mtd> <mi>x</mi> </mtd> </mtr> <mtr> <mtd> <mrow> <mrow /> <mi>k</mi> </mrow> </mtd> </mtr> </mtable> </mrow> </mfenced> <mfenced close=")" open="("> <mrow> <mtable> <mtr> <mtd> <mrow> <mi>x</mi> <mo>+</mo> <mi>k</mi> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mrow /> <mi>k</mi> </mrow> </mtd> </mtr> </mtable> </mrow> </mfenced> <msup> <mn>2</mn> <mi>k</mi> </msup> </mrow> </math></EquationSource> </Equation>and solve some open problems. For any odd prime <i>p</i> and <i>p</i>-adic integer <i>x</i>, we determine <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\sum _{n=0}^{p-1}t_n(x)^2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mo>∑</mo> <mrow> <mi>n</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mi>p</mi> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <msub> <mi>t</mi> <mi>n</mi> </msub> <msup> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mn>2</mn> </msup> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\sum _{n=0}^{p-1}(n+1)t_n(x)^2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mo>∑</mo> <mrow> <mi>n</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mi>p</mi> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <msub> <mi>t</mi> <mi>n</mi> </msub> <msup> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mn>2</mn> </msup> </mrow> </math></EquationSource> </InlineEquation> modulo <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(p^2\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>p</mi> <mn>2</mn> </msup> </math></EquationSource> </InlineEquation>; for example, we establish that <Equation ID="Equ25"> <EquationSource Format="TEX">\(\begin{aligned} \sum _{n=0}^{p-1}t_n(x)^2\equiv {\left\{ \begin{array}{ll} \left( \dfrac{-1}{p}\right) \pmod {p^2},&amp; \text {if }2x\equiv -1\pmod {p},\\ (-1)^{\langle x\rangle _p}\dfrac{p+2(x-\langle x\rangle _p)}{2x+1}\pmod {p^2},&amp; \text {otherwise,} \end{array}\right. } \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <munderover> <mo>∑</mo> <mrow> <mi>n</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mi>p</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <msub> <mi>t</mi> <mi>n</mi> </msub> <msup> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mn>2</mn> </msup> <mo>≡</mo> <mfenced open="{"> <mrow> <mtable> <mtr> <mtd columnalign="left"> <mrow> <mfenced close=")" open="("> <mstyle displaystyle="true" scriptlevel="0"> <mfrac> <mrow> <mo>-</mo> <mn>1</mn> </mrow> <mi>p</mi> </mfrac> </mstyle> </mfenced> <mspace width="10.0pt" /> <mrow> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <msup> <mi>p</mi> <mn>2</mn> </msup> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> </mrow> </mtd> <mtd columnalign="left"> <mrow> <mtext>if</mtext> <mspace width="0.333333em" /> <mn>2</mn> <mi>x</mi> <mo>≡</mo> <mo>-</mo> <mn>1</mn> <mspace width="10.0pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mi>p</mi> <mo stretchy="false">)</mo> <mo>,</mo> </mrow> </mtd> </mtr> <mtr> <mtd columnalign="left"> <mrow> <mrow /> <msup> <mrow> <mo stretchy="false">(</mo> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <msub> <mrow> <mo stretchy="false">⟨</mo> <mi>x</mi> <mo stretchy="false">⟩</mo> </mrow> <mi>p</mi> </msub> </msup> <mstyle displaystyle="true" scriptlevel="0"> <mfrac> <mrow> <mi>p</mi> <mo>+</mo> <mn>2</mn> <mo stretchy="false">(</mo> <mi>x</mi> <mo>-</mo> <msub> <mrow> <mo stretchy="false">⟨</mo> <mi>x</mi> <mo stretchy="false">⟩</mo> </mrow> <mi>p</mi> </msub> <mo stretchy="false">)</mo> </mrow> <mrow> <mn>2</mn> <mi>x</mi> <mo>+</mo> <mn>1</mn> </mrow> </mfrac> </mstyle> <mspace width="10.0pt" /> <mrow> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <msup> <mi>p</mi> <mn>2</mn> </msup> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> </mrow> </mtd> <mtd columnalign="left"> <mtext>otherwise,</mtext> </mtd> </mtr> </mtable> </mrow> </mfenced> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>where <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(\langle x\rangle _p\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mo stretchy="false">⟨</mo> <mi>x</mi> <mo stretchy="false">⟩</mo> </mrow> <mi>p</mi> </msub> </math></EquationSource> </InlineEquation> denotes the least nonnegative residue of <i>x</i> modulo <i>p</i>. This confirms a conjecture of Z.-W. Sun.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

On Some Conjectural Supercongruences Involving the Sequence \(t_n(x)\)

  • Hui-Li Han,
  • Chen Wang

摘要

In this paper, we study some supercongruences involving the sequence \( t_n(x)=\sum _{k=0}^n\left( {\begin{array}{c}n\\ k\end{array}}\right) \left( {\begin{array}{c}x\\ k\end{array}}\right) \left( {\begin{array}{c}x+k\\ k\end{array}}\right) 2^k \) t n ( x ) = k = 0 n n k x k x + k k 2 k and solve some open problems. For any odd prime p and p-adic integer x, we determine \(\sum _{n=0}^{p-1}t_n(x)^2\) n = 0 p - 1 t n ( x ) 2 and \(\sum _{n=0}^{p-1}(n+1)t_n(x)^2\) n = 0 p - 1 ( n + 1 ) t n ( x ) 2 modulo \(p^2\) p 2 ; for example, we establish that \(\begin{aligned} \sum _{n=0}^{p-1}t_n(x)^2\equiv {\left\{ \begin{array}{ll} \left( \dfrac{-1}{p}\right) \pmod {p^2},& \text {if }2x\equiv -1\pmod {p},\\ (-1)^{\langle x\rangle _p}\dfrac{p+2(x-\langle x\rangle _p)}{2x+1}\pmod {p^2},& \text {otherwise,} \end{array}\right. } \end{aligned}\) n = 0 p - 1 t n ( x ) 2 - 1 p ( mod p 2 ) , if 2 x - 1 ( mod p ) , ( - 1 ) x p p + 2 ( x - x p ) 2 x + 1 ( mod p 2 ) , otherwise, where \(\langle x\rangle _p\) x p denotes the least nonnegative residue of x modulo p. This confirms a conjecture of Z.-W. Sun.