English
Related papers

Related papers: A search for primes $p$ such that Euler number $E_…

200 papers

This article, complement to the article [Que], deals with some generalizations of Futw\"angler's theorems for the second case of Fermat's Last Theorem (FLT2). Let $p$ be an odd prime, $\zeta$ a $p$th primitive root of unity, $K:=\Q(\zeta)$…

Number Theory · Mathematics 2013-04-24 Roland Quême

We establish some supercongruences related to a supercongruence of Van Hamme, such as \begin{align*} \sum_{k=0}^{(p+1)/2} (-1)^k (4k-1)\frac{(-\frac{1}{2})_k^3}{k!^3} &\equiv p(-1)^{(p+1)/2}+p^3(2-E_{p-3})\pmod{p^{4}},\\…

Combinatorics · Mathematics 2019-03-12 Victor J. W. Guo , Ji-Cai Liu

We study the Generalized Fermat Equation $x^2 + y^3 = z^p$, to be solved in coprime integers, where $p \ge 7$ is prime. Using modularity and level lowering techniques, the problem can be reduced to the determination of the sets of rational…

Number Theory · Mathematics 2019-06-17 Nuno Freitas , Bartosz Naskrecki , Michael Stoll

In this paper, we apply the power-partible reduction to study arithmetic properties of sums involving Delannoy numbers $D_k$ and polynomials $D_k(z)$. Let $v\in\bN$ and $p$ be an odd prime. It is proved that, for any…

Combinatorics · Mathematics 2025-05-12 Rong-Hua Wang , Michael X. X. Zhong

Let $p>3$ be a prime, and let $a$ be a rational p-adic integer. Let $\{B_n(x)\}$ and $\{E_n(x)\}$ denote the Bernoulli polynomials and Euler polynomials, respectively. In this paper we show that $$\sum_{k=0}^{p-1}\binom…

Number Theory · Mathematics 2014-07-29 Zhi-Hong Sun

Let $p$ be an odd prime. In this paper we investigate quadratic residues modulo $p$ and related permutations, congruences and identities. If $a_1<\ldots<a_{(p-1)/2}$ are all the quadratic residues modulo $p$ among $1,\ldots,p-1$, then the…

Number Theory · Mathematics 2019-07-10 Zhi-Wei Sun

The Franel numbers are defined by $ f_n=\sum_{k=0}^n {n\choose k}^3. $ Motivated by the recent work of Z.-W. Sun on Franel numbers, we prove that \begin{align*} \sum_{k=0}^{n-1}(3k+1)(-16)^{n-k-1} {2k\choose k} f_k &\equiv…

Number Theory · Mathematics 2014-04-29 Victor J. W. Guo

Let $p$ be a prime and let $g(p)$ be the least primitive root modulo $p$. We prove that for any $\epsilon>0$ and $p$ large enough the bound \begin{align} g(p)\ll p^{\frac{1}{4\sqrt{e}}+\epsilon} \nonumber \end{align} holds for most prime…

Number Theory · Mathematics 2018-01-23 Andrea Sartori

In this paper, we mainly prove the following conjectures of Z.-W. Sun \cite{S13}: Let $p>2$ be a prime. If $p=x^2+3y^2$ with $x,y\in\mathbb{Z}$ and $x\equiv1\pmod 3$, then $$x\equiv\frac14\sum_{k=0}^{p-1}(3k+4)\frac{f_k}…

Number Theory · Mathematics 2024-09-20 Guo-Shuai Mao , Yan Liu

The title equation, where $p>3$ is a prime number $\not\equiv 7 \pmod 8$, $q$ is an odd prime number and $x,y,n$ are positive integers with $x,y$ relatively prime, is studied. When $p\equiv 3\pmod 8$, we prove (Theorem 2.3) that there are…

Number Theory · Mathematics 2021-08-27 A. Laradji , M. Mignotte , N. Tzanakis

For a prime $p$ and an integer $a \in \Z$ we obtain nontrivial upper bounds on the number of solutions to the congruence $x^x \equiv a \pmod p$, $1 \le x \le p-1$. We use these estimates to estimate the number of solutions to the congruence…

Number Theory · Mathematics 2010-03-11 Antal Balog , Kevin A. Broughan , Igor E. Shparlinski

Let \(d_k(p)\) denote the natural density of positive integers whose \(k\)-th smallest prime divisor is \(p\). Erd\H{o}s asked whether, for each fixed \(k\), the sequence \(p\mapsto d_k(p)\) is unimodal as \(p\) ranges over the primes.…

Number Theory · Mathematics 2026-05-12 Shouqiao Wang , Davide Crapis

In this paper, we use the modular method over totally real fields together with some standard conjectures (the Weak Frey--Mazur Conjecture and the Eichler--Shimura Conjecture) to prove that infinitely many equations of the type…

Number Theory · Mathematics 2025-01-30 Yasemin Kara , Diana Mocanu , Ekin Özman

Nagell proved that for each prime $p\equiv 1\pmod{3}$, $p > 7$, there is a prime $q<2p^{1/2}$ that is a cubic residue modulo $p$. Here we show that for each fixed $\epsilon > 0$, and each prime $p\equiv 1\pmod{3}$ with $p > p_0(\epsilon)$,…

Number Theory · Mathematics 2017-11-07 Kübra Benli , Paul Pollack

Many Dirichlet series of number theoretic interest can be written as a product of generating series $\zeta_{\,d,a}(s)=\prod\limits_{p\equiv a\pmod{d}}(1-p^{-s})^{-1}$, with $p$ ranging over all the primes in the primitive residue class…

Number Theory · Mathematics 2025-09-25 Alessandro Languasco , Pieter Moree

We study $p$-adic Euler's series $E_p(t) = \sum_{k=0}^{\infty}k!t^k$ at a point $p^a$, $a \in \mathbb{Z}_{\ge 1}$, and use Pad\'e approximations to prove a lower bound for the $p$-adic absolute value of the expression $cE_p\left(\pm…

Number Theory · Mathematics 2022-06-14 Anne-Maria Ernvall-Hytönen , Tapani Matala-Aho , Louna Seppälä

A prime number $p$ is said to be a Wolstenholme prime if it satisfies the congruence ${2p-1\choose p-1} \equiv 1 \,\,(\bmod{\,\,p^4})$. For such a prime $p$, we establish the expression for ${2p-1\choose p-1}\,\,(\bmod{\,\,p^8})$ given in…

Number Theory · Mathematics 2018-04-10 Romeo Mestrovic

Let H(N) denote the Hurwitz class number. It is known that if $p$ is a prime, then {equation*} \sum_{|r|<2\sqrt p}H(4p-r^2) = 2p. {equation*} In this paper, we investigate the behavior of this sum with the additional condition $r\equiv…

Number Theory · Mathematics 2012-08-24 Brittany Brown , Neil J. Calkin , Timothy B. Flowers , Kevin James , Ethan Smith , Amy Stout

Given a squarefree positive integer $d$, we want to find integers (or rational numbers with denominators not divisible by large primes) $a_0,a_1,a_2,\ldots$ such that for sufficiently large primes $p$ we have $\sum_{k=0}^{p-1}a_k\equiv…

Number Theory · Mathematics 2014-02-21 Zhi-Wei Sun

We show that Fermat's last theorem and a combinatorial theorem of Schur on monochromatic solutions of $a+b=c$ implies that there exist infinitely many primes. In particular, for small exponents such as $n=3$ or $4$ this gives a new proof of…

Number Theory · Mathematics 2023-05-03 Christian Elsholtz