Search arXivSearch

arXiv · 1511.06221

Proof of some congruence conjectures of Guo and Liu

Abstract

Let $n$ and $r$ be positive integers. Define the numbers $S_n^{(r)}$ by $S_n^{(r)}=\sum_{k=0}^n\binom{n}{k}^2\binom{2k}{k}(2k+1)^r.$ In this paper we prove some conjectures of Guo and Liu which extend some conjectures of Z.-W. Sun \cite{Su1}, such as: There exist integers $a_{2r-1}$ and $b_r$, independent of $n$, such that $$a_{2r-1}\sum_{k=0}^{n-1}S_k^{(2r-1)}\equiv0\pmod{n^2}\ \mbox{and}\ b_r\sum_{k=0}^{n-1}kS_k^{(r)}\equiv0\pmod{n^2}.$$ By Zeilberger algorithm, we find that for all $0\leq j<n$, $$(2j+1)\binom{2j}j\sum_{k=j}^{n-1}(2k-j+1)\binom kj^2\equiv0\pmod{n^2}.$$

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guo-Shuai Mao. 2018-12-10. Proof of some congruence conjectures of Guo and Liu. https://doi.org/10.1007/s11139-018-0066-z

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