Searcharxiv⌕ Search

arXiv · 2610.15050

Proof of Two Conjectural $q$-Supercongruences Related to Van Hamme's $\mathrm{(G.2)}$ Supercongruence

Abstract

In this paper, we prove two conjectures concerning parametric $q$- supercongruences related to Van Hamme's $\mathrm{(G.2)}$ supercongruence. First, we confirm Tang\rq s conjecture \cite[Conjecture $4.1$]{Tang G2} by establishing the corresponding congruences modulo $[m]Φ_m(q)^2$. Second, we prove a conjecture of Wang and Xu \cite[Conjecture $2$]{WangXu24}, extending their $q$-supercongruence modulo $Φ_m(q)^5$ to modulo $[m]Φ_m(q)^4$ when $m\equiv1\pmod4$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Liton Karmakar, Arijit Jana. 2026-10-10. Proof of Two Conjectural $q$-Supercongruences Related to Van Hamme's $\mathrm{(G.2)}$ Supercongruence. https://arxiv.org/abs/2610.15050

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Sporadic points on $X_0(N)$

We determine all integers $N$ for which the modular curve $X_0(N)$ admits a sporadic CM point (of any degree), as well as all $N$ for which $X_0(N)$ admits a sporadic point, whether CM or non-CM. In a sense, our results generalize the classification of isogenies of elliptic curves over $\Q$ due to Mazur and Kenku: their work determines the $X_0(N)$ with degree 1 sporadic points, whereas we classify all $X_0(N)$ that have a sporadic point of arbitrary degree.

math.NT↗

On the Number of Prime Factors of Consecutive Integers

We prove that there are infinitely many $n$ such that $ω(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao and Teräväinen (2025), who have $O(k)$ in place of $O(\log k)$. As corollaries, we make progress on a number of questions posed by Erdős. The proof is based on a quantitative refinement of the Tao-Teräväinen probabilistic argument, combining a refined sieve construction with upper bounds for high moments and the resulting tail estimates. Moreover, we formulate a conjecture on integers with many prime factors based on Cramér-type random models. Assuming this conjecture, the main bound is essentially sharp.

math.NT↗