<p>Employing the creative microscoping method and the Chinese remainder theorem for polynomials, we give a parametric <i>q</i>-supercongruence and two Dwork-type <i>q</i>-supercongruences. As a corollary we deduce that, for primes <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(p\equiv 1\pmod {4}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>≡</mo> <mn>1</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>4</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(r\geqslant 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>r</mi> <mo>⩾</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>, <Equation ID="Equ34"> <EquationSource Format="TEX">\( \sum _{k=0}^{p^r-1}(6k+1)\frac{(\frac{1}{2})_k(\frac{1}{4})_k^2}{k!^3}4^k \equiv p \sum _{k=0}^{p^{r-1}-1}(6k+1)\frac{(\frac{1}{2})_k(\frac{1}{4})_k^2}{k!^3}4^k \pmod {p^{3r}}, \)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <munderover> <mo>∑</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msup> <mi>p</mi> <mi>r</mi> </msup> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mrow> <mo stretchy="false">(</mo> <mn>6</mn> <mi>k</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mfrac> <mrow> <msub> <mrow> <mo stretchy="false">(</mo> <mfrac> <mn>1</mn> <mn>2</mn> </mfrac> <mo stretchy="false">)</mo> </mrow> <mi>k</mi> </msub> <msubsup> <mrow> <mo stretchy="false">(</mo> <mfrac> <mn>1</mn> <mn>4</mn> </mfrac> <mo stretchy="false">)</mo> </mrow> <mi>k</mi> <mn>2</mn> </msubsup> </mrow> <mrow> <mi>k</mi> <msup> <mo>!</mo> <mn>3</mn> </msup> </mrow> </mfrac> <msup> <mn>4</mn> <mi>k</mi> </msup> <mo>≡</mo> <mi>p</mi> <munderover> <mo>∑</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msup> <mi>p</mi> <mrow> <mi>r</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <mrow> <mo stretchy="false">(</mo> <mn>6</mn> <mi>k</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mfrac> <mrow> <msub> <mrow> <mo stretchy="false">(</mo> <mfrac> <mn>1</mn> <mn>2</mn> </mfrac> <mo stretchy="false">)</mo> </mrow> <mi>k</mi> </msub> <msubsup> <mrow> <mo stretchy="false">(</mo> <mfrac> <mn>1</mn> <mn>4</mn> </mfrac> <mo stretchy="false">)</mo> </mrow> <mi>k</mi> <mn>2</mn> </msubsup> </mrow> <mrow> <mi>k</mi> <msup> <mo>!</mo> <mn>3</mn> </msup> </mrow> </mfrac> <msup> <mn>4</mn> <mi>k</mi> </msup> <mspace width="10.0pt" /> <mrow> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <msup> <mi>p</mi> <mrow> <mn>3</mn> <mi>r</mi> </mrow> </msup> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> </mrow> </math></EquationSource> </Equation>and a similar result for primes <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(p\equiv 3\pmod {4}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>≡</mo> <mn>3</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>4</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(r\geqslant 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>r</mi> <mo>⩾</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\( \sum _{k=0}^{p^r-1}(6k+1)\frac{(\frac{1}{2})_k(\frac{1}{4})_k^2 4^k }{k!^3} \equiv p^2 \sum _{k=0}^{p^{r-2}-1}(6k+1)\frac{(\frac{1}{2})_k(\frac{1}{4})_k^2 4^k }{k!^3} \pmod {p^{3r-2}}, \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mo>∑</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msup> <mi>p</mi> <mi>r</mi> </msup> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo stretchy="false">(</mo> <mn>6</mn> <mi>k</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mfrac> <mrow> <msub> <mrow> <mo stretchy="false">(</mo> <mfrac> <mn>1</mn> <mn>2</mn> </mfrac> <mo stretchy="false">)</mo> </mrow> <mi>k</mi> </msub> <msubsup> <mrow> <mo stretchy="false">(</mo> <mfrac> <mn>1</mn> <mn>4</mn> </mfrac> <mo stretchy="false">)</mo> </mrow> <mi>k</mi> <mn>2</mn> </msubsup> <msup> <mn>4</mn> <mi>k</mi> </msup> </mrow> <mrow> <mi>k</mi> <msup> <mo>!</mo> <mn>3</mn> </msup> </mrow> </mfrac> <mo>≡</mo> <msup> <mi>p</mi> <mn>2</mn> </msup> <msubsup> <mo>∑</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <msup> <mi>p</mi> <mrow> <mi>r</mi> <mo>-</mo> <mn>2</mn> </mrow> </msup> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mrow> <mo stretchy="false">(</mo> <mn>6</mn> <mi>k</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mfrac> <mrow> <msub> <mrow> <mo stretchy="false">(</mo> <mfrac> <mn>1</mn> <mn>2</mn> </mfrac> <mo stretchy="false">)</mo> </mrow> <mi>k</mi> </msub> <msubsup> <mrow> <mo stretchy="false">(</mo> <mfrac> <mn>1</mn> <mn>4</mn> </mfrac> <mo stretchy="false">)</mo> </mrow> <mi>k</mi> <mn>2</mn> </msubsup> <msup> <mn>4</mn> <mi>k</mi> </msup> </mrow> <mrow> <mi>k</mi> <msup> <mo>!</mo> <mn>3</mn> </msup> </mrow> </mfrac> <mspace width="4.44443pt" /> <mrow> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <msup> <mi>p</mi> <mrow> <mn>3</mn> <mi>r</mi> <mo>-</mo> <mn>2</mn> </mrow> </msup> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> where <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\((x)_0=1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mn>0</mn> </msub> <mo>=</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\((x)_k=x(x+1)\cdots (x+k-1)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mi>k</mi> </msub> <mo>=</mo> <mi>x</mi> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mo>⋯</mo> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo>+</mo> <mi>k</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(k\geqslant 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>⩾</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>.</p>

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

A Parametric q-Supercongruence and Two Dwork-Type q-Supercongruences

  • Victor J. W. Guo,
  • Xing-Ye Zhu

摘要

Employing the creative microscoping method and the Chinese remainder theorem for polynomials, we give a parametric q-supercongruence and two Dwork-type q-supercongruences. As a corollary we deduce that, for primes \(p\equiv 1\pmod {4}\) p 1 ( mod 4 ) and \(r\geqslant 1\) r 1 , \( \sum _{k=0}^{p^r-1}(6k+1)\frac{(\frac{1}{2})_k(\frac{1}{4})_k^2}{k!^3}4^k \equiv p \sum _{k=0}^{p^{r-1}-1}(6k+1)\frac{(\frac{1}{2})_k(\frac{1}{4})_k^2}{k!^3}4^k \pmod {p^{3r}}, \) k = 0 p r - 1 ( 6 k + 1 ) ( 1 2 ) k ( 1 4 ) k 2 k ! 3 4 k p k = 0 p r - 1 - 1 ( 6 k + 1 ) ( 1 2 ) k ( 1 4 ) k 2 k ! 3 4 k ( mod p 3 r ) , and a similar result for primes \(p\equiv 3\pmod {4}\) p 3 ( mod 4 ) and \(r\geqslant 2\) r 2 , \( \sum _{k=0}^{p^r-1}(6k+1)\frac{(\frac{1}{2})_k(\frac{1}{4})_k^2 4^k }{k!^3} \equiv p^2 \sum _{k=0}^{p^{r-2}-1}(6k+1)\frac{(\frac{1}{2})_k(\frac{1}{4})_k^2 4^k }{k!^3} \pmod {p^{3r-2}}, \) k = 0 p r - 1 ( 6 k + 1 ) ( 1 2 ) k ( 1 4 ) k 2 4 k k ! 3 p 2 k = 0 p r - 2 - 1 ( 6 k + 1 ) ( 1 2 ) k ( 1 4 ) k 2 4 k k ! 3 ( mod p 3 r - 2 ) , where \((x)_0=1\) ( x ) 0 = 1 and \((x)_k=x(x+1)\cdots (x+k-1)\) ( x ) k = x ( x + 1 ) ( x + k - 1 ) for \(k\geqslant 1\) k 1 .