English
Related papers

Related papers: A generalization of the Romanoff theorem

200 papers

We estimate the asymptotic density of the set $\bar{A}$ of primes $p$ satisfying the constraint that $p+1$ and $p-1$ have only one prime divisor larger than $3$. We also estimate the density of a maximal subset $\bar{B} \subset \bar{A}$…

Number Theory · Mathematics 2018-12-31 Carlos Esparza , Lukas Gehring

Let $k$ be an integer which is the difference between prime numbers infinitely often. It is known that there are infinitely many such $k$ and, in this paper, we give a new unconditional proof that these $k$ have positive density and improve…

Number Theory · Mathematics 2015-01-28 Stijn S. C. Hanson

Let $X$ be a sufficiently large positive integer. We prove that one may choose a subset $S$ of primes with cardinality $O(\log X)$, such that a positive proportion of integers less than $X$ can be represented by $x^2 + p y^2$ for at least…

Number Theory · Mathematics 2023-01-10 Yijie Diao

The prime number theorem, established by Hadamard and de la Vall'ee Poussin independently in 1896, asserts that the density of primes in the positive integers is asymptotic to 1 / ln x. Whereas their proofs made serious use of the methods…

Artificial Intelligence · Computer Science 2007-05-23 Jeremy Avigad , Kevin Donnelly , David Gray , Paul Raff

For any positive integer $n$, let $\sigma(n)=\sum_{d\mid n} d$. In 2020, M. Kobayashi and T. Trudgian showed that the natural density of positive integers n with $\sigma(kn+r_1) \geq \sigma(kn+r_2)$ is between 0.053 and 0.055. In this…

Number Theory · Mathematics 2026-03-13 Xin-qi Luo , Chen-kai Ren

Let $P$ be a subset of the primes of lower density strictly larger than $\frac12$. Then, every sufficiently large even integer is a sum of four primes from the set $P$. We establish similar results for $k$-summands, with $k\geq 4$, and for…

Number Theory · Mathematics 2024-11-05 Michael T. Lacey , Hamed Mousavi , Yaghoub Rahimi , Manasa N. Vempati

We classify the asymptotic densities of the $\Delta^0_2$ sets according to their level in the Ershov hierarchy. In particular, it is shown that for $n \geq 2$, a real $r \in [0,1]$ is the density of an $n$-c.e.\ set if and only if it is a…

Logic · Mathematics 2014-08-19 Rod Downey , Carl Jockusch , Timothy H. McNicholl , Paul Schupp

For a nonnegative integer $t$, let $c_t$ be the asymptotic density of natural numbers $n$ for which $s(n + t) \geq s(n)$, where $s(n)$ denotes the sum of digits of $n$ in base $2$. We prove that $c_t > 1/2$ for $t$ in a set of asymptotic…

Combinatorics · Mathematics 2016-05-03 Michael Drmota , Manuel Kauers , Lukas Spiegelhofer

We derive explicit asymptotic expansions of the density of the supremum of a strictly stable process when the index $\alpha$ is not rational. In the case when parameters $\alpha$ and $\rho=\p(X_1>0)$ satisfy $\rho+k=l/\alpha$ for some…

Probability · Mathematics 2010-06-15 Alexey Kuznetsov

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

Let $ \lfloor {x} \rfloor $ denote the greatest integer less than or equal to a real number $x$. Given real numbers $0<\alpha_1 < \alpha_2 < \cdots< \alpha_k < 1$ satisfying a certain condition, we show that there are infinitely many…

Number Theory · Mathematics 2025-12-23 Anup B. Dixit , Nikhil S Kumar

Let $P$ and $T$ be disjoint sets of prime numbers with $T$ finite. A simple formula is given for the natural density of the set of square-free numbers which are divisible by all of the primes in $T$ and by none of the primes in $P$. If $P$…

Number Theory · Mathematics 2021-02-12 Ron Brown

For a real number $q>1$ and a positive integer $m$, let $Y_m(q):={\sum_{i=0}^n\epsilon_i q^i:\; \epsilon_i\in \{0, \pm 1,..., \pm m\}, n=0, 1,...}.$ In this paper, we show that $Y_m(q)$ is dense in ${\Bbb R}$ if and only if $q<m+1$ and $q$…

Number Theory · Mathematics 2015-02-03 De-Jun Feng

We use the convolution method for arithmetic functions of several variables to deduce an asymptotic formula for the number of $k$-tuples of positive integers with components which are pairwise non-coprime and $\le x$. More generally, we…

Number Theory · Mathematics 2024-12-09 László Tóth

We find an asymptotic formula for the number of pairs of positive integers $x_1, x_2 \le H$ such that the product $x_1 x_2$ is a $k$-th power.

Number Theory · Mathematics 2010-01-05 Doychin Tolev

Let $\N$ denote the set of positive integers. The asymptotic density of the set $A \subseteq \N$ is $d(A) = \lim_{n\to\infty} |A\cap [1,n]|/n$, if this limit exists. Let $ \mathcal{AD}$ denote the set of all sets of positive integers that…

Number Theory · Mathematics 2007-05-23 Melvyn B. Nathanson , Rohit Parikh

In this paper we present a method for producing asymptotic estimates for the number of integers in a given S having only ``small'' prime factors. The conditions that need to be verified are simpler than those required by other methods, and…

Number Theory · Mathematics 2007-05-23 Ernie Croot

For a fixed rational number g different from -1,0,1 and integers a and d the set N_g(a,d) of primes p for which the order of g(mod p) is congruent to a(mod d) is considered. It is shown, assuming the Generalized Riemann Hypothesis (GRH),…

Number Theory · Mathematics 2007-05-23 Pieter Moree

We show that there are sets of integers with asymptotic density arbitrarily close to 1 in which there is no solution to the equation ab=c, with a,b,c in the set. We also consider some natural generalizations, as well as a specific numerical…

Number Theory · Mathematics 2012-11-19 Par Kurlberg , Jeffrey C. Lagarias , Carl Pomerance

Let $\mathcal{A}$ be the set of all integers of the form $\gcd(n, F_n)$, where $n$ is a positive integer and $F_n$ denotes the $n$th Fibonacci number. We prove that $\#\left(\mathcal{A} \cap [1, x]\right) \gg x / \log x$ for all $x \geq 2$,…

Number Theory · Mathematics 2020-12-15 Paolo Leonetti , Carlo Sanna