Search arXivSearch

arXiv · 1401.5978

Some q-analogues of supercongruences of Rodriguez-Villegas

Abstract

We study different q-analogues and generalizations of the ex-conjectures of Rodriguez-Villegas. For example, for any odd prime p, we show that the known congruence \sum_{k=0}^{p-1}\frac{{2k\choose k}^2}{16^k} \equiv (-1)^{\frac{p-1}{2}}\pmod{p^2} has the following two nice q-analogues with [p]=1+q+...+q^{p-1}: \sum_{k=0}^{p-1}\frac{(q;q^2)_k^2}{(q^2;q^2)_k^2}q^{(1+\varepsilon)k} &\equiv (-1)^{\frac{p-1}{2}}q^{\frac{(p^2-1)\varepsilon}{4}}\pmod{[p]^2}, where (a;q)_0=1, (a;q)_n=(1-a)(1-aq)...(1-aq^{n-1}) for n=1,2,..., and \varepsilon=\pm1. Several related conjectures are also proposed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Victor J. W. Guo, Jiang Zeng. 2014-08-03. Some q-analogues of supercongruences of Rodriguez-Villegas. https://doi.org/10.1016/j.jnt.2014.06.002

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

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT