English
Related papers

Related papers: Congruences for Wolstenholme primes

200 papers

A prime $p$ is called a Wieferich prime if $2^{p-1}\equiv 1 \pmod{p^2}$. A monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N\ge 2$ is called monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and…

Number Theory · Mathematics 2026-05-25 Lenny Jones

Let $m>2$ and $q>0$ be integers with $m$ even or $q$ odd. We show the supercongruence $$\sum_{k=0}^{p-1}(-1)^{km}\binom{p/m-q}{k}^m\equiv0\pmod{p^3}.$$ for any prime $p>mq$. This confirms a conjecture of Sun.

Number Theory · Mathematics 2015-04-29 Xiang-Zi Meng , Zhi-Wei Sun

Given an odd prime p, we prove a congruence on the p-residue of the Fermat quotient q_p(a) in base a with 0<a<p, which arises from a generalization of the Voronoi congruences and from some other congruences on sums and weighted sums of…

Number Theory · Mathematics 2021-08-31 Claire I. Levaillant

Let $p>3$ be a prime, and let $m$ be an integer with $p\nmid m$. In the paper we prove some supercongruences concerning $$\align &\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom{3k}k}{54^k},\…

Number Theory · Mathematics 2011-01-06 Zhi-Hong Sun

Let p be an odd prime. Let K = Q(zeta) be the p-cyclotomic field. Let v be any primitive root mod p. Let sigma be a Q-isomorphism of K. Let P(sigma) = sigma^{p-2}v^{-(p-2)}+ ... + sigma v^{-1} +1 \in Z[G] where 1 \leq v^n \leq p-1 is a…

Number Theory · Mathematics 2007-05-23 Roland Queme

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

Number Theory · Mathematics 2018-04-13 Romeo Meštrović

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…

Logic in Computer Science · Computer Science 2022-05-25 Ruben Gamboa , Woodrow Gamboa

We produce congruences modulo a prime $p>3$ for sums $\sum_k\binom{3k}{k}x^k$ over ranges $0\le k<q$ and $0\le k<q/3$, where $q$ is a power of $p$. Here $x$ equals either $c^2/(1-c)^3$, or $4s^2/\bigl(27(s^2-1)\bigr)$, where $c$ and $s$ are…

Number Theory · Mathematics 2022-10-13 Sandro Mattarei , Roberto Tauraso

By recent work of the author, Wilson's theorem as well as the Wilson quotient can be described by supercongruences of power sums of Fermat quotients modulo every higher prime power. We translate these congruences into congruences of power…

Number Theory · Mathematics 2025-10-31 Bernd C. Kellner

In this paper we establish some new congruences involving central binomial coefficients as well as Catalan numbers. Let $p$ be a prime and let $a$ be any positive integer. We determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}$ mod $p^2$ for…

Number Theory · Mathematics 2011-06-03 Zhi-Wei Sun , Roberto Tauraso

The aim of this work is to establish congruences $\left( \operatorname{mod}p^{2}\right) $ involving the trinomial coefficients $\binom{np-1}{p-1}_{2}$ and $\binom{np-1}{\left( p-1\right)/2}_{2}$ arising from the expansion of the powers of…

Number Theory · Mathematics 2019-10-22 Laid Elkhiri , Miloud Mihoubi

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

Number Theory · Mathematics 2014-06-25 Tewodros Amdeberhan

We prove that if p is a prime with a primitive root 2 then S_p(2^p)=p and give a sufficient condition for an equality of kind S_p(2^p)=+or-p.

Number Theory · Mathematics 2011-11-10 Vladimir Shevelev

Let $p\ge 5$ be a prime, and let $q_p(2):=(2^{p-1}-1)/p$ be the Fermat quotient of $p$ to base 2. The following curious congruence was conjectured by L. Skula and proved by A. Granville $$ q_p(2)^2\equiv…

Number Theory · Mathematics 2018-04-10 Romeo Mestrovic

A conjecture of Mordell states that if $p$ is a prime and $p$ is congruent to $3$ mod $4$, then $p$ does not divide $y$ where $(x,y)$ is the fundamental solution to $x^{2}-py^{2}=1$. The conjecture has been verified for primes not exceeding…

Number Theory · Mathematics 2019-06-28 Debopam Chakraborty , Anupam Saikia

We prove that if $q$ is a power of a prime $p$ and $p^k$ divides $a$, with $k\ge 0$, then \[ 1+(q-1)\sum_{0\le b(q-1)<a} \binom{a}{b(q-1)}\equiv 0\pmod{p^{k+1}}. \] The special case of this congruence where $q=p$ was proved by Carlitz in…

Number Theory · Mathematics 2007-05-23 Sandro Mattarei

Let $\{f_n\}$ be the Franel numbers given by $f_n=\sum_{k=0}^n\binom nk^3$, and let $p>5$ be a prime. In this paper we mainly determine $\sum_{k=0}^{p-1} \binom{2k}k\frac{f_k}{m^k}\pmod p$ for $m=5,-16,16,32,-49,50,96$. Let…

Number Theory · Mathematics 2015-05-05 Zhi-Hong Sun

The Fermat quotient $q_p(a):=(a^{p-1}-1)/p$, for prime $p\nmid a$, and the Wilson quotient $w_p:=((p-1)!+1)/p$ are integers. If $p\mid w_p,$ then $p$ is a Wilson prime. For odd $p,$ Lerch proved that $(\sum_{a=1}^{p-1} q_p(a) - w_p)/p$ is…

Number Theory · Mathematics 2014-12-16 Jonathan Sondow

In this paper, we partly prove a supercongruence conjectured by Z.-W. Sun in 2013. Let $p$ be an odd prime and let $a\in\mathbb{Z}^{+}$. Then if $p\equiv1\pmod3$, we have \begin{align*}…

Number Theory · Mathematics 2022-05-24 Guo-Shuai Mao

Let $p$ be an odd prime, and let $m$ be an integer with $p\nmid m$. In this paper show that $$\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom ak\binom{-1-a}k}{m^k} \equiv 0\pmod p \quad\hbox{implies}\quad\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom ak…

Number Theory · Mathematics 2015-03-12 Zhi-Hong Sun