English
Related papers

Related papers: Sums of four prime cubes in short intervals

200 papers

Let $k\ge 1$ be an integer. We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{k}+p_{2}^{2}+p_{3}^{2}$, where $p_1,p_2,p_3$ are prime numbers, holds in intervals shorter than the ones…

Number Theory · Mathematics 2021-06-04 Alessandro Languasco , Alessandro Zaccagnini

Let $s$, $\ell$ be two integers such that $2\le s\le \ell-1$, $\ell\ge 3$. We prove that a suitable asymptotic formula for the average number of representations of integers $n=\sum_{i=1}^{s} p_{i}^{\ell}$, where $p_i$, $i=1,\dotsc,s$, are…

Number Theory · Mathematics 2019-01-23 Alessandro Languasco

We improve some results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms $n=p_{1}^{\ell_1}+p_{2}^{\ell_2}$ and $n=p^{\ell_1} + m^{\ell_2}$, where $\ell_1, \ell_2\ge 2$ are…

Number Theory · Mathematics 2020-12-08 Alessandro Languasco , Alessandro Zaccagnini

We prove results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms $n=p_{1}^{\ell_1}+p_{2}^{\ell_2}$, with $\ell_1, \ell_2\in\{2,3\}$, $\ell_1+\ell_2\le 5$ are fixed…

Number Theory · Mathematics 2019-08-21 Alessandro Languasco , Alessandro Zaccagnini

We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime square and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in…

Number Theory · Mathematics 2017-01-03 Alessandro Languasco , Alessandro Zaccagnini

We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in the…

Number Theory · Mathematics 2017-05-12 Alessandro Languasco , Alessandro Zaccagnini

Let $R_{m, \mathrm{sq-full}}(N)$ be a representation function for the sum of a prime and a square-full number. In this article, we prove an asymptotic formula for the sum of $R_{m, \mathrm{sq-full}}(N)$ over positive integers $N$ in a short…

Number Theory · Mathematics 2024-05-08 Fumi Ogihara , Yuta Suzuki

We give formulas for the number of representations of non negative integers by various quadratic forms. We also give evaluations in the case of sum of two cubes (cubic case) and the quintic case, as well. We introduce a class of generalized…

General Mathematics · Mathematics 2015-04-30 Nikos Bagis , M. L Glasser

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

Number Theory · Mathematics 2016-11-23 Adrian Dudek

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 prove asymptotic formulae for small weighted solutions of quadratic congruences of the form $\lambda_1x_1^2+\cdots +\lambda_nx_n^2\equiv \lambda_{n+1}\bmod{p^m}$, where $p$ is a fixed odd prime, $\lambda_1,...,\lambda_{n+1}$ are integer…

Number Theory · Mathematics 2026-01-29 Stephan Baier , Arkaprava Bhandari , Anup Haldar

Assuming the Riemann Hypothesis, we obtain asymptotic formulas for the average number representations of an even integer as the sum of two primes. We use the method of Bhowmik and Schlage-Puchta and refine their results slightly to obtain a…

Number Theory · Mathematics 2016-01-27 D. A. Goldston , Liyang Yang

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

We investigate the asymptotic formula for the number of representations of a large positive integer as a sum of $k$-th powers of integers represented as the sums of three positive cubes, counted with multiplicities. We also obtain a lower…

Number Theory · Mathematics 2020-12-17 Javier Pliego

We extend a result by Ikeda and Suriajaya (2025) to find the asymptotic behaviour of the average number of representations of an integer $n$, over multiples of a fixed $q\ge 2$, as a sum of two prime $k$-th powers, for $k\ge 2$.

Number Theory · Mathematics 2026-03-26 Alessandra Migliaccio , Alessandro Zaccagnini

Let $N$ be a sufficiently large, odd integer. We prove an asymptotic formula for the number of representations of $N$ as the sum of three primes, one of which is smaller than a given $U$. By inserting the currently best zero-density…

Number Theory · Mathematics 2026-05-20 Michael Harm

We prove that a suitable explicit formula for the Cesaro-averaged number of representations of an integer as a sum of two primes holds in short intervals.

Number Theory · Mathematics 2017-07-28 Alessandro Languasco , Alessandro Zaccagnini

Assuming the Riemann Hypothesis we prove that the interval $[N, N + H]$ contains an integer which is a sum of a prime and two squares of primes provided that $H \ge C (\log N)^{4}$, where $C > 0$ is an effective constant.

Number Theory · Mathematics 2016-06-07 Alessandro Languasco , Alessandro Zaccagnini

We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…

Number Theory · Mathematics 2020-12-08 Marco Cantarini , Alessandro Gambini , Alessandro Zaccagnini

We study the representations of large integers $n$ as sums $p_1^2 + ... + p_s^2$, where $p_1,..., p_s$ are primes with $| p_i - (n/s)^{1/2} | \le n^{\theta/2}$, for some fixed $\theta < 1$. When $s = 5$ we use a sieve method to show that…

Number Theory · Mathematics 2012-01-27 Angel Kumchev , Taiyu Li
‹ Prev 1 2 3 10 Next ›