English
Related papers

Related papers: Sums of many primes

200 papers

In this paper, we consider representations of integers as sums of generalized heptagonal numbers with a prescribed number of repeats of each heptagonal number appearing in the sum. In particular, we investigate the classification of such…

Number Theory · Mathematics 2022-03-29 Ramanujam Kamaraj , Ben Kane , Ryoko Tomiyasu

Let a and f be coprime positive integers. Let g be an integer. Under the Generalized Riemann Hypothesis (GRH) it follows by a result of H.W. Lenstra that the set of primes p such that p=a(mod f) and g is a primitive root modulo p has a…

Number Theory · Mathematics 2012-07-30 Pieter Moree

We say a positive integer is a sum of three nonunit squares if it is a sum of three squares of integers other than one. In this article, we find all integers which are sums of three nonunit squares assuming that the Generalized Riemann…

Number Theory · Mathematics 2019-09-12 Daejun Kim , Jeongwon Lee , Byeong-Kweon Oh

In this note, assuming a variant of the Generalized Riemann Hypothesis, which does not exclude the existence of real zeros, we prove an asymptotic formula for the mean value of the representation function for the sum of two primes in…

Number Theory · Mathematics 2015-04-09 Yuta Suzuki

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the…

Number Theory · Mathematics 2022-07-19 Alina Carmen Cojocaru , McKinley Meyer

Let $k\ge 1$ be an integer. A positive integer $n$ is $k$-\textit{gleeful} if $n$ can be represented as the sum of $k$th powers of consecutive primes. For example, $35=2^3+3^3$ is a $3$-gleeful number, and $195=5^2+7^2+11^2$ is $2$-gleeful.…

Number Theory · Mathematics 2025-07-15 Sara Moore , Jonathan P. Sorenson

Let $\mathcal{B} = (B_1,\ldots, B_h)$ be an $h$-tuple of sets of positive integers. Let $g_{\mathcal{B} }(n)$ count the number of representations of $n$ in the form $n = b_1\cdots b_h$, where $b_i \in B_i$ for all $i \in \{1,\ldots, h\}$.…

Number Theory · Mathematics 2022-05-03 Melvyn B. Nathanson

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

Inspired by a classical result of R\'enyi, we prove that every even integer $N\geq 4$ can be written as the sum of a prime and a number with at most 395 prime factors. We also show, under assumption of the generalised Riemann hypothesis,…

Number Theory · Mathematics 2025-04-14 Daniel R. Johnston , Valeriia V. Starichkova

We prove an explicit formula, analogous to the classical explicit formula for $\psi(x)$, for the Ces\`aro-Riesz mean of any order $k>0$ of the number of representations of $n$ as a sum of two primes. Our approach is based on a double Mellin…

Number Theory · Mathematics 2019-09-25 J. Brüdern , J. Kaczorowski , A. Perelli

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

For a natural number $k>1$, let $f_k(n)$ denote the number of distinct representations of a natural number $n$ of the form $p^k+q^k$ for primes $p,q$. We prove that, for all $k>1$, $$\limsup_{n\to\infty}f_k(n)=\infty.$$ This positively…

Number Theory · Mathematics 2025-09-17 Anay Aggarwal

We discuss the evaluation of the average number of Goldbach representations for integers which are multiples of $q$ introduced by Granville. We improve an estimate given by Granville under the generalized Riemann hypothesis.

Number Theory · Mathematics 2025-04-30 Karin Ikeda , Ade Irma Suriajaya

Assuming a conjecture on distinct zeros of Dirichlet L-functions we get asymptotic results on the average number of representations of an integer as the sum of two primes in arithmetic progression. On the other hand the existence of good…

Number Theory · Mathematics 2019-02-20 Gautami Bhowmik , Karin Halupczok , Kohji Matsumoto , Yuta Suzuki

Extending a classical estimate of Mertens for the sum of the reciprocals of the first primes, we provide an explicit remainder formula for products of an arbitrary, but fixed, number of primes.

Number Theory · Mathematics 2019-10-08 Gérald Tenenbaum

We prove explicit versions of Cram\'er's theorem for primes in arithmetic progressions, on the assumption of the generalized Riemann hypothesis.

Number Theory · Mathematics 2019-01-15 Adrian W. Dudek , Loïc Grenié , Giuseppe Molteni

We prove the theorems which are equivalent to the Roland's results such that a new form of them allows to consider some generalizations. In particular, we give generators of primes more than a fixed prime.

Number Theory · Mathematics 2010-03-03 Vladimir Shevelev

In this paper, we consider representations of integers as sums of at most four distinct $m$-gonal numbers (allowing a fixed number of repeats of each polygonal number occurring in the sum). We show that the number of such representations…

Number Theory · Mathematics 2026-03-23 Kathrin Bringmann , Min-Joo Jang , Ben Kane , Cheuk Hin Alvin Tse

In this paper, we exhibit an asymptotic formula for the number of representations of a large integer as a sum of a fixed power of Piatetski-Shapiro primes, thereby establishing a variant of Waring-Goldbach problem with primes from a sparse…

Number Theory · Mathematics 2017-05-16 Yildirim Akbal , Ahmet Muhtar Guloglu

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