English
Related papers

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

200 papers

In this work, the author shows a sufficient and necessary condition for an integer of the form $(zn-y^n)/(z-y)$ to be divisible by some perfect $mth$ power $p$, where $p$ is an odd prime and $m$ is a positive integer. A constructive method…

General Mathematics · Mathematics 2019-06-06 Rachid Marsli

The Ap\'ery numbers $A_n$ and the Franel numbers $f_n$ are defined by $$A_n=\sum_{k=0}^{n}{\binom{n+k}{2k}}^2{\binom{2k}{k}}^2\ \ \ \ \ {\rm and }\ \ \ \ \ \ f_n=\sum_{k=0}^{n}{\binom{n}{k}}^3(n=0, 1, \cdots,).$$ In this paper, we prove…

Number Theory · Mathematics 2021-03-11 Yong Zhang

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…

Number Theory · Mathematics 2023-04-11 Guo-Shuai Mao

Translated from the Latin original, "Observationes circa bina biquadrata quorum summam in duo alia biquadrata resolvere liceat" (1772). E428 in the Enestroem index. This paper is about finding A,B,C,D such that $A^4+B^4=C^4+D^4$. In sect.…

History and Overview · Mathematics 2009-08-10 Leonhard Euler , Jordan Bell

For each prime $p$, let $n(p)$ denote the least quadratic nonresidue modulo $p$. Vinogradov conjectured that $n(p) = O(p^\eps)$ for every fixed $\eps>0$. This conjecture follows from the generalised Riemann hypothesis, and is known to hold…

Number Theory · Mathematics 2016-01-20 Terence Tao

Let p be an odd prime. Let K_p = Q(zeta) be the p-cyclotomic field. Let pi be the prime ideal of K_p lying over p. Let G be the Galois group of K_p. Let v be a primitive root mod p. Let sigma be a Q-isomorphism of K_p. Let P(sigma) =…

Number Theory · Mathematics 2007-05-23 Roland Queme

Dirichlet's proof of infinitely many primes in arithmetic progressions was published in 1837, introduced L-series for the first time, and it is said to have started rigorous analytic number theory. Dirichlet uses Euler's earlier work on the…

History and Overview · Mathematics 2014-11-25 Peter Gustav Lejeune Dirichlet

Let $$\gamma^*=\frac{8}{9}+\frac{2}{3}\:\frac{\log(10/9)}{\log 10}\:(\approx 0.919\ldots)\:.$$ Let $\gamma^*<\gamma_0\leq 1$, $c_0=1/\gamma_0$ be fixed. Let also $a_0\in\{0,1,\ldots, 9\}$.\\ We prove on assumption of the Generalized Riemann…

Number Theory · Mathematics 2021-07-05 Helmut Maier , Michael Th. Rassias

An ideal setting to exhibit infinite sets of primes $p$ relative to which an integer is a primitive root $\pmod p$ is provided by the B\'ezout subdomain $\widetilde{\mathbb{B}}:=\mathbb{Z}^{\mathbb{P}}/\mathfrak{U}$ of the valuation domain…

Number Theory · Mathematics 2026-04-15 Wayne Lewis

Let $p>3$ be a prime, and let $a$ be a rational p-adic integer with $a\not\equiv 0\pmod p$. In this paper we establish congruences for $$\sum_{k=1}^{(p-1)/2}\frac{\binom ak\binom{-1-a}k}k, \quad\sum_{k=0}^{(p-1)/2}k\binom ak\binom{-1-a}k…

Number Theory · Mathematics 2016-05-31 Zhi-Hong Sun

Given positive integers $a_1,\ldots,a_k$, we prove that the set of primes $p$ such that $p \not\equiv 1 \bmod{a_i}$ for $i=1,\ldots,k$ admits asymptotic density relative to the set of all primes which is at least $\prod_{i=1}^k…

Number Theory · Mathematics 2020-12-15 Paolo Leonetti , Carlo Sanna

Let $1<a<b$ be two relatively prime integers and $\mathbb{Z}_{\ge 0}$ the set of non-negative integers. For any non-negative integer $\ell$, denote by $g_{\ell,a,b}$ the largest integer $n$ such that the equation $$n=ax+by,\quad…

Number Theory · Mathematics 2025-10-03 Yuchen Ding , Takao Komatsu , Honghu Liu

The Franel numbers given by $f_n=\sum_{k=0}^n\binom{n}{k}^3$ ($n=0,1,2,\ldots$) play important roles in both combinatorics and number theory. In this paper we initiate the systematic investigation of fundamental congruences for the Franel…

Number Theory · Mathematics 2015-03-19 Zhi-Wei Sun

We show that for each prime p > 7, every residue mod p can be represented by a squarefree number with largest prime factor at most p. We give two applications to recursive prime generators akin to the one Euclid used to prove the infinitude…

Number Theory · Mathematics 2017-04-11 Andrew R. Booker , Carl Pomerance

For a prime $p\equiv 1 \,(\bmod{4})$, let \[ \varepsilon = \frac{1}{2}\left( t + u\sqrt{p}\right) \] be the fundamental unit of the real quadratic field $\mathbb{Q}(\sqrt{p})$. In 1951, N. Ankeny, E. Artin, and S. Chowla asked whether $p$…

Number Theory · Mathematics 2026-02-12 Nic Fellini , M. Ram Murty

For positive integers $q$, Dirichlet's theorem states that there are infinitely many primes in each reduced residue class modulo $q$. A stronger form of the theorem states that the primes are equidistributed among the $\varphi(q)$ reduced…

Number Theory · Mathematics 2019-08-21 David Wu

We prove that if $p \equiv 4,7 \pmod{9}$ is prime and $3$ is not a cube modulo $p$, then both of the equations $x^3+y^3=p$ and $x^3+y^3=p^2$ have a solution with $x,y \in \mathbb{Q}$.

Number Theory · Mathematics 2017-07-20 Samit Dasgupta , John Voight

We consider questions in Galois cohomology which arise by considering mod $p$ Galois representations arising from automorphic forms. We consider a Galois cohomological analog for the standard heuristics about the distribution of Wieferich…

Number Theory · Mathematics 2018-06-12 Gebhard Boeckle , David-A. Guiraud , Sudesh Kalyanswamy , Chandrashekhar Khare

The numbers $R_n$ and $W_n$ are defined as \begin{align*} R_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}\frac{1}{2k-1},\ \text{and}\ W_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}\frac{3}{2k-3}. \end{align*} We prove that, for any positive…

Number Theory · Mathematics 2015-01-06 Victor J. W. Guo , Ji-Cai Liu

In 1988, Koblitz conjectured the infinitude of primes p for which |E(F_p)| is prime for elliptic curves E over Q, drawing an analogy with the twin prime conjecture. He also proposed studying the primality of |E(F_{p^l})| / |E(F_p)|, in…

Number Theory · Mathematics 2025-04-29 Likun Xie