English
Related papers

Related papers: On the Waring-Goldbach problem on average

200 papers

The arithmetic average of the first $n$ primes, $\bar p_n = {1\over n} \sum_{i=1}^n p_i$, exhibits very many interesting and subtle properties. Since the transformation from $p_n \to \bar p_n$ is extremely easy to invert, $p_n = n\bar p_n -…

Number Theory · Mathematics 2025-07-17 Matt Visser

In this paper we establish a general asymptotic formula for the sum of the first $n$ prime numbers, which leads to a generalization of the most accurate asymptotic formula given by Massias and Robin. Further we prove a series of results…

Number Theory · Mathematics 2019-03-29 Christian Axler

We establish that almost every positive integer $n$ is the sum of four cubes, two of which are at most $n^{\theta}$, as long as $\theta\geq192/869$. An asymptotic formula for the number of such representations is established when…

Number Theory · Mathematics 2010-06-29 Siu-lun Alan Lee

We obtain an asymptotic formula on the Odlyzko-Stanley enumeration problem. Let $N_m^*(k,b)$ be the number of $k$-subsets $S\subseteq F_p^*$ such that $\sum_{x\in S}x^m=b$. If $m<p^{1-\delta}$, then there is a constant…

Number Theory · Mathematics 2012-07-31 Jiyou Li

We prove the following result: Let $N \geq 2$ and assume the Riemann Hypothesis (RH) holds. Then \[ \sum_{n=1}^{N} R(n) =\frac{N^{2}}{2} -2 \sum_{\rho} \frac{N^{\rho + 1}}{\rho (\rho + 1)} + O(N \log^{3}N), \] where $\rho=1/2+i\gamma$ runs…

Number Theory · Mathematics 2013-02-14 Alessandro Languasco , Alessandro Zaccagnini

Let $v\geq 2$ be a fixed integer, and let $x \geq 1$ and $z \geq x$ be large numbers. The exact asymptotic formula for the number of Wieferich primes $p$ such that $ v^{p-1} \equiv 1 \bmod p^2$ in the short interval $[x,x+z]$ is proposed in…

General Mathematics · Mathematics 2018-05-08 N. A. Carella

For $i\in \{1,2,3\}$, let $E_i(x)$ denote the error term in each of the three theorems of Mertens on the asymptotic distribution of prime numbers. We show that for $i\in \{1,2\}$ the Riemann hypothesis is equivalent to the condition…

Number Theory · Mathematics 2025-06-25 Tianyu Zhao

In this paper, we introduce a new type of generalized alternating hyperharmonic numbers $H_n^{(p,r,s_{1},s_{2})}$, and show that Euler sums of the generalized alternating hyperharmonic numbers $H_n^{(p,r,s_{1},s_{2})}$ can be expressed in…

Number Theory · Mathematics 2021-08-03 Rusen Li

We prove an asymptotic formula for the mean-square average of $L$- functions associated to subgroups of characters of sufficiently large size. Our proof relies on the study of certain character sums ${\cal A}(p,d)$ recently introduced by E.…

Number Theory · Mathematics 2020-07-07 Stéphane Louboutin , Marc Munsch

We establish an asymptotic formula for the number of lattice points in the sets \[ \mathbf S_{h_1, h_2, h_3}(\lambda): =\{x\in\mathbb Z_+^3:\lfloor h_1(x_1)\rfloor+\lfloor h_2(x_2)\rfloor+\lfloor h_3(x_3)\rfloor=\lambda\} \quad…

Dynamical Systems · Mathematics 2021-06-24 Alex Iosevich , Bartosz Langowski , Mariusz Mirek , Tomasz Z. Szarek

Let $\mathcal{P}=\{p_1,p_2,...\}$ be the set of all odd primes arranged in increasing order. A Goldbach partition of the even integer $2k>4$ is a way of writing it as a sum of two primes from $\mathcal{P}$ without regard to order. Let…

Probability · Mathematics 2016-08-09 Ljuben Mutafchiev

In 1938 E. T. Bell introduced "The Iterated Exponential Integers". He proved that these numbers may be expressed by polynomials with rational coefficients. However, Bell gave no formulas for any of the coefficients except the trivial one,…

Combinatorics · Mathematics 2019-03-20 Ivar Henning Skau , Kai Forsberg Kristensen

We show that for integers $k\geq 4$ and $s\geq k^2+(3k-1)/4$, we have an asymptotic formula for the number of solutions, in positive integers $x_i$, to the inequality $\left|(x_1-\theta_1)^k+\dotsc+(x_s-\theta_s)^k-\tau\right|<\eta$, where…

Number Theory · Mathematics 2016-12-01 Kirsti Biggs

We prove an asymptotic formula for the number of $n$-dimensional representations of the group $\mathrm{SU}(3)$. Main tools for the proof are Wright's Circle Method and the Saddle Point Method.

Representation Theory · Mathematics 2021-07-08 Kathrin Bringmann , Johann Franke

Let $R(N)$ be the number of representations of $N$ as a sum of a prime and a square-full number weighted with logarithmic function. In $2024$, the author and Y. Suzuki obtained an asymptotic formula for the sum of $R(N)$ over positive…

Number Theory · Mathematics 2025-06-06 Fumi Ogihara

Let $\Lambda$ be the von Mangoldt function and $r_{Q}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}\Lambda\left(m_{1}\right)$ be the counting function for the numbers that can be written as sum of a prime and two squares (that we will…

Number Theory · Mathematics 2017-08-24 Marco Cantarini

By exploiting an old idea first used by Pizzetti for the classical Laplacian, we introduce a notion of {\it asymptotic average solutions} making pointwise solvable every Poisson equation $\mathcal{L} u(x)=-f(x)$ with continuous data $f$,…

Analysis of PDEs · Mathematics 2022-09-20 Alessia E. Kogoj , Ermanno Lanconelli

Let $f_1,\ldots,f_k : \mathbb{N} \rightarrow \mathbb{C}$ be multiplicative functions taking values in the closed unit disc. Using an analytic approach in the spirit of Hal\'{a}sz' mean value theorem, we compute multidimensional averages of…

Number Theory · Mathematics 2017-08-11 Oleksiy Klurman , Alexander P. Mangerel

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

A sequence of positive integers $(a_1,a_2,\ldots,a_k)$ is called $\ell$-additive if $a_1+a_2+\cdots+a_k=\ell a_1$ or $\ell a_k$. In this paper, we prove that for all $k\geq3$, if $n$ is sufficiently large, then every permutation of…

Combinatorics · Mathematics 2026-05-29 Collier Gaiser , Paul Horn