English
Related papers

Related papers: On the Karatsuba divisor problem

200 papers

Assuming the Riemann Hypothesis we establish an upper bound for the sum of the M{\" o}bius function up to $x$. Our method is based on estimating the frequency with which intervals of a given length can contain an unusual number of ordinates…

Number Theory · Mathematics 2008-02-13 K. Soundararajan

We prove new arithmetic results for parametric linear recurrence sequences specialized at roots of unity, denoted by $(U_n(\zeta))_{n\geq 0}$. In particular, we obtain exponential lower bounds for the largest prime ideal divisor and norm of…

Number Theory · Mathematics 2026-02-09 Darsana N , Sudhansu Sekhar Rout

Let $s_a(n)$ denote the sum of digits of an integer $n$ in the base $a$ expansion. Answering, in a extended form, a question of Deshouillers, Habsieger, Laishram, and Landreau, we show that, provided $a$ and $b$ are multiplicatively…

Number Theory · Mathematics 2018-12-19 Régis de la Bretèche , Thomas Stoll , Gérald Tenenbaum

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

Combinatorics · Mathematics 2008-06-23 Jozsef Solymosi

We prove new upper bounds for a spectral exponential sum by refining the process by which one evaluates mean values of $L$-functions multiplied by an oscillating function. In particular, we introduce a method which is capable of taking into…

Number Theory · Mathematics 2018-09-19 Olga Balkanova , Dmitry Frolenkov

In this paper we introduce the prime index function \begin{align}\iota(n)=(-1)^{\pi(n)},\nonumber \end{align} where $\pi(n)$ is the prime counting function. We study some elementary properties and theories associated with the partial sums…

General Mathematics · Mathematics 2021-08-24 Theophilus Agama

Let $d^{(k)}(n)$ be the $k$-free divisor function for integer $k\ge2$. Let $a$ be a nonzero integer. In this paper, we establish an asymptotic formula \begin{equation*} \sum_{p\leq x} d^{(k)}(p-a) =b_k \cdot x+O\left(\frac{x}{\log x}\right)…

Number Theory · Mathematics 2024-06-19 Biao Wang

Let $\tau(n)$ be the number of divisors of $n$. We give an elementary proof of the fact that $$ \sum_{n\le x} \tau(n)^r =xC_{r} (\log x)^{2^r-1}+O(x(\log x)^{2^r-2}), $$ for any integer $r\ge 2$. Here, $$ C_{r}=\frac{1}{(2^r-1)!}…

Number Theory · Mathematics 2017-07-05 Florian Luca , László Tóth

We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.

Number Theory · Mathematics 2015-11-09 Jan Büthe

For $p$ being a large prime number, and $A \subset \mathbb{F}_p$ we prove the following: $(i)$ If $A(A+A)$ does not cover all nonzero residues in $\mathbb{F}_p$, then $|A| < p/8 + o(p)$. $(ii)$ If $A$ is both sum-free and satisfies $A =…

Number Theory · Mathematics 2023-02-09 Aliaksei Semchankau

For any real $t$, the unitary divisor function $\sigma_t^*$ is the multiplicative arithmetic function defined by $\sigma_t^*(p^{\alpha})=1+p^{\alpha t}$ for all primes $p$ and positive integers $\alpha$. Let $\overline{\sigma_t^*(\mathbb…

Number Theory · Mathematics 2018-06-20 Colin Defant

The optimal function $f$ satisfying $$ \mathbb{E} |\sum_{1}^n X_i | \ge f(\mathrbb{E}|X_1|,...,\mathbb{E}|X_n|) $$ for every martingale $(X_1,X_1+X_2, ...,\sum_{i=1}^n X_i)$ is shown to be given by $$ f(a) = \max \Big\{a_k-\sum_{i=1}^{k-1}…

Probability · Mathematics 2009-04-16 Lutz Mattner , Uwe Rösler

Consider any Dirichlet series sum a_n/n^z with nonnegative coefficients a_n and finite sum function f(z)=f(x+iy) when x is greater than 1. Denoting the partial sum a_1+...+a_N by s_N, the paper gives the following necessary and sufficient…

Number Theory · Mathematics 2008-07-04 Jacob Korevaar

Update: This work reproduces an earlier result of Peck, which the author was initially unaware of. The method of the proof is essentially the same as the original work of Peck. There are no new results. We show that the sum of squares of…

Number Theory · Mathematics 2012-11-07 J. Maynard

Let $k\ge 2$ be a positive integer and $P^+(n)$ the greatest prime factor of a positive integer $n$ with convention $P^+(1)=1$. For any $\theta\in \left[\frac 1{2k},\frac{17}{32k}\right)$, set…

Number Theory · Mathematics 2023-06-06 Yuchen Ding , Lilu Zhao

Infinite series of Bessel function of the first kind, $\sum_\nu^{\pm\infty} J_{N\nu+p}(x)$, $\sum_\nu^{\pm\infty} (-1)^\nu J_{N\nu+p}(x)$, are summed in closed form. These expressions are evaluated by engineering a Dirac comb that selects…

Mathematical Physics · Physics 2022-11-04 Suk Hyun Sung , Robert Hovden

We prove that given $\lambda \in \mathbb{R}$ such that $0 < \lambda < 1$, then $\pi(x + x^\lambda) - \pi(x) \sim \displaystyle \frac{x^\lambda}{\log(x)}$. This solves a long-standing problem concerning the existence of primes in short…

Number Theory · Mathematics 2026-05-08 Luan Alberto Ferreira

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

Number Theory · Mathematics 2025-06-17 Matt Visser

Let $k \ge 2$ be a fixed integer. We define the multiplicative function $D_k(n) = d_k(n)/d_k^*(n)$, such that $d_k(n)$ is the Piltz divisor function and $d_k^*(n) = k^{\omega(n)}$ is its unitary analogue, where $\omega(n)$ is the number of…

Number Theory · Mathematics 2026-02-16 Meselem Karras

A bound for functional $\Delta(F)=\sup_{x\in\mathbb R}|F(x)-\Phi(x)|$ is obtained, which is uniform for all distribution functions $F$ of random variables with zero mean-value and unity variance. Moreover, a two-point distribution is found,…

Probability · Mathematics 2007-10-19 V. I. Chebotarev , A. S. Kondrik , K. V. Mikhaylov