English
Related papers

Related papers: A density version of Waring-Goldbach problem

200 papers

We study the densest subgraph problem and its NP-hard densest at-most-$k$ subgraph variant through the lens of learning-augmented algorithms. We show that, given a reasonably accurate predictor that estimates whether a node belongs to the…

Data Structures and Algorithms · Computer Science 2026-04-16 Thai Bui , Luan Nguyen , Hoa T. Vu

Let $K$ be a number field, and let $G$ be a finitely generated subgroup of $K^\times$. Without relying on the Generalized Riemann Hypothesis we prove an asymptotic formula for the number of primes $\mathfrak p$ of $K$ such that the order of…

Number Theory · Mathematics 2023-03-24 Pietro Sgobba

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 present in this work a heuristic expression for the density of prime numbers. Our expression leads to results which possesses approximately the same precision of the Riemann's function in the domain that goes from 2 to 1010 at least.…

General Mathematics · Mathematics 2008-03-05 L. A. Amarante Ribeiro

We present a method for finding large fixed-size primes of the form $X^2+c$. We study the density of primes on the sets $E_c = \{N(X,c)=X^2+c,\ X \in (2\mathbb{Z}+(c-1))\}$, $c \in \mathbb{N}^*$. We describe an algorithm for generating…

Data Structures and Algorithms · Computer Science 2023-12-20 Marc Wolf , François Wolf

For a fixed rational number g, not equal to -1,0 or 1 and integers a and d we consider the set of primes p for which the order of g(mod p) is congruent to a(mod d). For d=4 and d=3 it is shown that, under the Generalized Riemann Hypothesis,…

Number Theory · Mathematics 2016-09-07 Pieter Moree

This work concerns Artin's Conjecture on primitive roots and related problems for number fields. Let $K$ be a number field and let $W_1$ to $W_n$ be finitely generated subgroups of $K^\times$ of positive rank. We consider the index map,…

Number Theory · Mathematics 2022-11-29 Olli Järviniemi , Antonella Perucca , Pietro Sgobba

Given positive integers a,b,c and d such that c and d are coprime we show that the primes p=c(mod d)dividing a^k+b^k for some k>=1 have a natural density and explicitly compute this density. We demonstrate our results by considering some…

Number Theory · Mathematics 2012-07-30 P. Moree , B. Sury

Every integer greater than two can be expressed as the sum of a prime and a square-free number. Expanding on recent work, we provide explicit and asymptotic results when divisibility conditions are imposed on the square-free number. For…

Number Theory · Mathematics 2023-11-27 Shehzad Hathi , Daniel R. Johnston

We introduce a wide class of deterministic subsets of primes of zero relative density and we prove Roth's Theorem in these sets, namely, we show that any subset of them with positive relative upper density contains infinitely many…

Classical Analysis and ODEs · Mathematics 2023-01-02 Leonidas Daskalakis

Let $A$ be a finite set of integers. We show that if $k$ is a prime power or a product of two distinct primes then $$|A+k\cdot A|\geq(k+1)|A|-\lceil k(k+2)/4\rceil$$ provided $|A|\geq (k-1)^{2}k!$, where $A+k\cdot A=\{a+kb:\ a,b\in A\}$. We…

Combinatorics · Mathematics 2014-02-21 Shan-Shan Du , Hui-Qin Cao , Zhi-Wei Sun

We establish mean convergence for multiple ergodic averages with iterates given by distinct fractional powers of primes and related multiple recurrence results. A consequence of our main result is that every set of integers with positive…

Dynamical Systems · Mathematics 2022-05-19 Nikos Frantzikinakis

The ternary Goldbach conjecture (or three-prime conjecture) states that every odd number greater than 5 can be written as the sum of three primes. The purpose of this book is to give the first proof of the conjecture, in full.

Number Theory · Mathematics 2015-01-29 Harald Andres Helfgott

Let a and b be non-zero rational numbers that are multiplicatively independent. We study the natural density of the set of primes p for which the subgroup of the multiplicative group of the finite field with p elements generated by (a\mod…

Number Theory · Mathematics 2007-05-23 Pieter Moree , Peter Stevenhagen

Given a connected graph $G$ on $n$ vertices and a positive integer $k\le n$, a subgraph of $G$ on $k$ vertices is called a $k$-subgraph in $G$. We design combinatorial approximation algorithms for finding a connected $k$-subgraph in $G$…

Discrete Mathematics · Computer Science 2015-01-30 Xujin Chen , Xiaodong Hu , Changjun Wang

Recent progress on Vinogradov's mean value theorem has resulted in improved estimates for exponential sums of Weyl type. We apply these new estimates to obtain sharper bounds for the function $H(k)$ in the Waring--Goldbach problem. We…

Number Theory · Mathematics 2017-05-17 Angel V. Kumchev , Trevor D. Wooley

We know that any prime number of form $4s+1$ can be written as a sum of two perfect square numbers. As a consequence of Goldbach's weak conjecture, any number great than $10$ can be represented as a sum of four primes. We are motivated to…

Number Theory · Mathematics 2017-05-24 Haifeng Xu

In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…

Number Theory · Mathematics 2023-02-07 Ameneh Farhadian , Hamid Reza Fanai

In this paper we study the sum of powers in the Gaussian integers $\mathbf{G}_k(n):=\sum_{a,b \in [1,n]} (a+b i)^k$. We give an explicit formula for $\mathbf{G}_k(n) \pmod n $ in terms of the prime numbers $p \equiv 3 \pmod 4$ with $p \mid…

Number Theory · Mathematics 2014-02-05 Pedro Fortuny Ayuso , Jose Maria Grau , Antonio Oller-Marcen

We prove that if $A$ is any set of prime numbers satisfying \[ \sum_{a\in A}\frac{1}{a}=\infty, \] then $A$ must contain a $3$-term arithmetic progression. This is accomplished by combining the transference principle with a density…

Number Theory · Mathematics 2015-06-12 Eric Naslund
‹ Prev 1 4 5 6 7 8 10 Next ›