Papers
Topics
Authors
Recent
Search
2000 character limit reached

$q$-Supercongruences from transformation formulas

Published 24 Sep 2021 in math.NT | (2109.12034v1)

Abstract: Let $\Phi_{n}(q)$ denote the $n$-th cyclotomic polynomial in $q$. Recently, Guo and Schlosser [Constr. Approx. 53 (2021), 155--200] put forward the following conjecture: for an odd integer $n>1$, \begin{align*} &\sum_{k=0}{n-1}[8k-1]\frac{(q{-1};q4)k6(q2;q2){2k}}{(q4;q4)k6(q{-1};q2){2k}}q{8k}\notag\ &\quad\equiv\begin{cases}0 \pmod{[n]\Phi_n(q)2}, &\text{if }n\equiv 1\pmod{4},\[5pt] 0 \pmod{[n]},&\text{if }n\equiv 3\pmod{4}. \end{cases} \end{align*} Applying the `creative microscoping' method and several summation and transformation formulas for basic hypergeometric series and the Chinese remainder theorem for coprime polynomials, we confirm the above conjecture, as well as another similar $q$-supercongruence conjectured by Guo and Schlosser.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.