English
Related papers

Related papers: The shifted prime-divisor function over shifted pr…

200 papers

In this article, we study the second moment of cubic Dirichlet L-functions at the central point $s=1/2$ over the rational function field $\mathbb{F}_q(T)$, where $q$ is a power of an odd prime satisfying $q \equiv 2 \pmod{3}$. Our result…

Number Theory · Mathematics 2025-05-27 Shivani Goel , Anwesh Ray

We investigate the first moment of primes in progressions $$ \sum_{\substack{q\leq x/N \\ (q,a)=1}} \Big(\psi(x; q, a) - \frac x{\varphi(q)}\Big) $$ as $x, N \to \infty$. We show unconditionally that, when $a=1$, there is a significant bias…

Number Theory · Mathematics 2021-04-07 Sary Drappeau , Daniel Fiorilli

We show that if the difference of two elements of a set $A \subseteq [N]$ is never one less than a prime number, then $|A| = O (N \exp (-c (\log N)^{1/3}))$ for some absolute constant $c>0$.

Classical Analysis and ODEs · Mathematics 2020-03-05 Ruoyi Wang

We consider the distribution in residue classes modulo primes $p$ of Euler's totient function $\phi(n)$ and the sum-of-proper-divisors function $s(n):=\sigma(n)-n$. We prove that the values $\phi(n)$, for $n\le x$, that are coprime to $p$…

Number Theory · Mathematics 2021-05-28 Noah Lebowitz-Lockard , Paul Pollack , Akash Singha Roy

We study a general class of weighted shifts whose weights $\alpha$ are given by $\alpha_n = \sqrt{\frac{p^n + N}{p^n + D}}$, where $p > 1$ and $N$ and $D$ are parameters so that $(N,D) \in (-1, 1)\times (-1, 1)$. Some few examples of these…

Functional Analysis · Mathematics 2026-05-12 Chafiq Benhida , Raul E. Curto , George R. Exner

We study the second moment of Dirichlet $L$-functions to a large prime modulus $q$ twisted by the square of an arbitrary Dirichlet polynomial. We break the $\frac{1}{2}$-barrier in this problem, and obtain an asymptotic formula provided…

Number Theory · Mathematics 2018-09-03 H. M. Bui , Kyle Pratt , Nicolas Robles , Alexandru Zaharescu

Let $c$ be a positive odd integer and $R$ a set of $n$ primes coprime with $c$. We consider equations $X + Y = c^z$ in three integer unknowns $X$, $Y$, $z$, where $z > 0$, $Y > X > 0$, and the primes dividing $XY$ are precisely those in…

Number Theory · Mathematics 2023-01-24 Reese Scott , Robert Styer

We study the average distribution of primes of size $x$ in arithmetic progressions to moduli larger than $x^{\frac{1}{2}}$. Using arithmetic information from the works of many authors together with different variants of the original…

Number Theory · Mathematics 2026-05-28 Runbo Li

We prove lower bounds of the form $\gg N/(\log N)^{3/2}$ for the number of primes up to $N$ primitively represented by a shifted positive definite integral binary quadratic form, and under the additional condition that primes are from an…

Number Theory · Mathematics 2025-04-30 Elena Fuchs , Catherine Hsu , James Rickards , Damaris Schindler , Katherine E. Stange

Assuming a uniform $q$-variant of the prime $k$-tuple conjecture, we compute moments of the number of primes in arithmetic progressions to a large modulus $q$ as the residue classes vary. Consequently, depending on the size of $\varphi(q)$,…

Number Theory · Mathematics 2025-07-08 Sun-Kai Leung

We prove a couple of related theorems including Legendre's and Andrica's conjecture. Key to the proofs is an algorithm that delivers the exact upper bound on the greatest gap that can occur in a combinatorial game with the set of P primes…

General Mathematics · Mathematics 2015-08-11 Jens Oehlschlägel

We prove a Lindel\"{o}f-on-average upper bound for the second moment of the $L$-functions associated to a level 1 holomorphic cusp form, twisted along a coset of subgroup of the characters modulo $q^{2/3}$ (where $q = p^3$ for some odd…

Number Theory · Mathematics 2025-05-27 Agniva Dasgupta

We study some divisibility properties of quasiperfect numbers. We show that if $N=(p_1 p_2 \cdots p_t)^{2a}=m^2$ is quasiperfect, then $2a+1$ is divisible by $3$ and $N$ has at least one prime factor smaller than $\exp 716.7944$. Moreover,…

Number Theory · Mathematics 2017-11-30 Tomohiro Yamada

Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and their position and possible or impossible functional generation…

General Mathematics · Mathematics 2017-09-13 Sandor Kristyan

We obtain an asymptotic formula for the average value of the divisor function over the integers $n \le x$ in an arithmetic progression $n \equiv a \pmod q$, where $q=p^k$ for a prime $p\ge 3$ and a sufficiently large integer $k$. In…

Number Theory · Mathematics 2016-02-12 Kui Liu , Igor E. Shparlinski , Tianping Zhang

Let $\pi(x;\gamma_1,\gamma_2)$ denote the number of primes $p$ with $p\leqslant x$ and $p=\lfloor n^{1/\gamma_1}_1\rfloor=\lfloor n^{1/\gamma_2}_2\rfloor$, where $\lfloor t\rfloor$ denotes the integer part of $t\in\mathbb{R}$ and…

Number Theory · Mathematics 2023-10-02 Xiaotian Li , Wenguang Zhai , Jinjiang Li

For $a/q\in\mathbb{Q}$ the Estermann function is defined as $D(s,a/q):=\sum_{n\geq1}d(n)n^{-s}\operatorname{e}(n\frac aq)$ if $\Re(s)>1$ and by meromorphic continuation otherwise. For $q$ prime, we compute the moments of $D(s,a/q)$ at the…

Number Theory · Mathematics 2019-03-27 Sandro Bettin

Assuming the Riemann Hypothesis we study negative moments of the Riemann zeta-function and obtain asymptotic formulas in certain ranges of the shift in $\zeta(s)$. For example, integrating $|\zeta(1/2+\alpha+it)|^{-2k}$ with respect to $t$…

Number Theory · Mathematics 2023-02-15 Hung M. Bui , Alexandra Florea

We prove near-optimal upper bounds for the odd moments of the distribution of coprime residues in short intervals, confirming a conjecture of Montgomery and Vaughan. As an application we prove near-optimal upper bounds for the average of…

Number Theory · Mathematics 2026-05-13 Thomas F. Bloom , Vivian Kuperberg

We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…

Number Theory · Mathematics 2025-08-05 Mihai Prunescu , Joseph M. Shunia