Related papers: Congruences for Wolstenholme primes

In this paper we prove that for any prime $p\ge 11$ holds $$ {2p-1\choose p-1}\equiv 1 -2p \sum_{k=1}^{p-1}\frac{1}{k} +4p^2\sum_{1\le i<j\le p-1}\frac{1}{ij}\pmod{p^7}. $$ This is a generalization of the famous Wolstenholme's theorem which…

We give a family of congruences for the binomial coefficients ${kp-1\choose p-1}$ in terms of multiple harmonic sums, a generalization of the harmonic numbers. Each congruence in this family (which depends on an additional parameter $n$)…

In this paper, we prove that for any odd prime $p$ and for any $p$-integer $\alpha $,we have $ \binom{\alpha p-1}{p-1}\equiv 1-\alpha (\alpha -1)(\alpha ^{2}-\alpha -1)p\sum_{k=1}^{p-1}\frac{1}{k}+\alpha ^{2} (\alpha-1)^{2}p^{2}\sum_{1\leq…

A Wolstenholme prime is a prime number $p \geq 5$ that divides the numerator of the Bernoulli number $B_{p-3}$. A number of equivalent definitions for Wolstenholme primes are known, mostly related to congruences of harmonic sums or binomial…

A prime $p$ is a Wolstenholme prime if $\binom{2p}{p}\equiv2$ mod $p^4$, or, equivalently, if $p$ divides the numerator of the Bernoulli number $B_{p-3}$; a Vandiver prime $p$ is one that divides the Euler number $E_{p-3}$. Only two…

In this paper, we confirm some congruences conjectured by V.J.W. Guo and M.J. Schlosser recently. For example, we show that for primes $p>3$, $$…

In this paper, we mainly prove a congruence conjecture of Z.-W. Sun \cite{Sjnt}: Let $p>5$ be a prime. Then $$ \sum_{k=(p+1)/2}^{p-1}\frac{\binom{2k}k^2}{k16^k}\equiv-\frac{21}2H_{p-1}\pmod{p^4}, $$ where $H_n$ denotes the $n$-th harmonic…

Let $p$ be a prime and ${\mathfrak P}_p$ the set of positive integers which are prime to $p$. Recently, Wang and Cai proved that for every positive integer $r$ and prime $p>2$ $$ \sum_{\substack{i+j+k=p^r\\ i,j,k\in{\mathfrak P}_p}}…

Let $p>3$ be a prime. In this paper, we obtain the congruences for $$\sum_{k=0}^{p-1}\frac{w(k)\binom{2k}k^3}{(-8)^k},\ \sum_{k=0}^{p-1}\frac{w(k)\binom{2k}k^2\binom{3k}k}{(-192)^k},\…

In this paper we establish some sophisticated congruences involving central binomial coefficients and Fibonacci numbers. For example, we show that if $p\not=2,5$ is a prime then $$\sum_{k=0}^{p-1}F_{2k}\binom{2k}{k}=(-1)^{[p/5]}(1-(p/5))…

Given a prime $p\geq 5$, we reduce modulo p a convolution of order p-1 of powers of two weighted Bernoulli numbers with Bernoulli numbers in terms of harmonic numbers and generalized harmonic numbers. Our proof is based on studying the…

In this paper, we mainly prove two congruence conjecture of Z.-W. Sun. Let $p\equiv3\pmod 4$ be a prime. Then $$\sum_{k=0}^{p-1}\frac{\binom{2k}k^2}{8^k}\equiv-\sum_{k=0}^{p-1}\frac{\binom{2k}k^2}{(-16)^k}\pmod{p^3}.$$ And for any odd prime…

Let $p>3$ be a prime. For any $p$-adic integer $a$, we determine $$\sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}kH_k,\ \ \sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}kH_k^{(2)},\ \ \sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}k\frac{H_k^{(2)}}{2k+1}$$ modulo…

In 1862 Wolstenholme proved that for any prime $p\ge 5$ the numerator of the fraction $$ 1+\frac 12 +\frac 13+...+\frac{1}{p-1} $$ written in reduced form is divisible by $p^2$, $(2)$ and the numerator of the fraction $$ 1+\frac{1}{2^2}…

Let $p$ be an odd prime. In 2008 E. Mortenson proved van Hamme's following conjecture: $$\sum_{k=0}^{(p-1)/2}(4k+1)\binom{-1/2}k^3\equiv (-1)^{(p-1)/2}p\pmod{p^3}.$$ In this paper we show further that…

The following congruence for power sums, $S_n(p)$, is well known and has many applications: $1^n+2^n +\dots +p^n \equiv\begin{cases} -1 \text{ mod } p, & \text{ if } \ p-1 \ | \ n; 0 \text{ mod } p, & \text{ if } \ p-1 \ \not| \ n,…

Let p be a prime and let a be a positive integer. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=1}^{p-1}\binom{2k}{k+d}/(km^{k-1})$ modulo $p$ for all d=0,...,p^a, where m is any integer not divisible by p.…

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…

In this article, we consider primes $p \equiv 5 \pmod 8$ and are able to prove that $p \equiv 5 \pmod {16}$ if $2p$ is a congruent number.

Let $p>3$ be a prime and let $a$ be a positive integer. We show that if $p\equiv1\pmod 4$ or $a>1$ then $$\sum_{k=0}^{\lfloor\frac34p^a\rfloor}\frac{\binom{2k}k^2}{16^k}\equiv\l(\frac{-1}{p^a}\r)\pmod{p^3}$$ with $(-)$ the Jacobi symbol,…