English
Related papers

Related papers: On the Density of Weak Polignac Numbers

200 papers

For $k\ge1$, a $k$-almost prime is a positive integer with exactly $k$ prime factors, counted with multiplicity. In this article we give elementary proofs of precise asymptotics for the reciprocal sum of $k$-almost primes. Our results match…

Number Theory · Mathematics 2022-01-31 Jonathan Bayless , Paul Kinlaw , Jared Duker Lichtman

In this paper we introduce new densities on the set of primes of a number field. If $K/K_0$ is a Galois extension of number fields, we associate to any element $x \in {\rm Gal}_{K/K_0}$ a density $\delta_{K/K_0,x}$ on primes of $K$. In…

Number Theory · Mathematics 2014-04-14 Alexander Ivanov

We prove that if A is a subset of the primes, and the lower density of A in the primes is larger than 1/2, then every sufficiently large even integer can be written as the sum of eight primes from A. The constant 1/2 in this statement is…

Number Theory · Mathematics 2024-09-25 Meng Gao

Given positive integers $a_1,\ldots,a_k$, we prove that the set of primes $p$ such that $p \not\equiv 1 \bmod{a_i}$ for $i=1,\ldots,k$ admits asymptotic density relative to the set of all primes which is at least $\prod_{i=1}^k…

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

By some extremely simple arguments, we point out the following: (i) If n is the least positive k-th power non-residue modulo a positive integer m, then the greatest number of consecutive k-th power residues mod m is smaller than m/n. (ii)…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

We give upper and lower bounds on the number of graphs of fixed degree which have a positive density of triangles. In particular, we show that there are very few such graphs, when compared to the number of graphs without this restriction.…

Mathematical Physics · Physics 2015-06-26 Pierre Collet , Jean-Pierre Eckmann

Let $\delta > 1/2$. We prove that if $A$ is a subset of the primes such that the relative density of $A$ in every reduced residue class is at least $\delta$, then almost all even integers can be written as the sum of two primes in $A$. The…

Number Theory · Mathematics 2024-09-20 Ali Alsetri , Xuancheng Shao

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

Number Theory · Mathematics 2018-04-13 Romeo Meštrović

We present a new topological proof of the infinitude of prime numbers with a new topology. Furthermore, in this topology, we characterize the infinitude of any non-empty subset of prime numbers.

Number Theory · Mathematics 2024-10-30 Jhixon Macías

We show by an inclusion-exclusion argument that the prime $k$-tuple conjecture of Hardy and Littlewood provides an asymptotic formula for the number of consecutive prime numbers which are a specified distance apart. This refines one aspect…

Number Theory · Mathematics 2012-06-29 D. A. Goldston , A. H. Ledoan

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

S\'ark\"ozy proved that dense sets of integers contain two elements differing by a $k$th power. The bounds in quantitative versions of this theorem are rather weak compared to what is expected. We prove a version of S\'ark\"ozy's theorem…

Number Theory · Mathematics 2017-05-09 Ben Green

We present a novel conjecture concerning the additive representation of natural numbers using prime powers. Based on extensive computational verification, we conjecture that every integer n > 23 can be expressed as a sum of at most five…

General Mathematics · Mathematics 2025-08-05 Julius Stricker

A Friedman number is a positive integer which is the result of an expression combining all of its own digits by use of the four basic operations, exponentiation and digit concatenation. A "nice" Friedman number is a Friedman number for…

Number Theory · Mathematics 2013-10-10 Michael Brand

Let $\mathrm{d}(A)$ be the asymptotic density (if it exists) of a sequence of integers $A$. For any real numbers $0\leq\alpha\leq\beta\leq 1$, we solve the question of the existence of a sequence $A$ of positive integers such that…

Number Theory · Mathematics 2019-05-21 Pierre-Yves Bienvenu , François Hennecart

This paper is devoted to the theory of prime numbers. In this paper we first introduce the notion of a matrix of prime numbers. Then, in order to investigate the density of prime numbers in separate rows of the matrix under consideration,…

General Mathematics · Mathematics 2018-05-02 S. N. Baibekov , A. A. Dossayeva

For a finite set of integers such that the first few gaps between its consecutive elements equal $a$, while the remaining gaps equal $b$, we study dense packings of its translates on the line. We obtain an explicit lower bound on the…

Combinatorics · Mathematics 2025-09-29 Alexander Natalchenko , Arsenii Sagdeev

We introduce a notion of palindromicity of a natural number which is independent of the base. We study the existence and density of palindromic and multiple palindromic numbers, and we raise several related questions.

General Mathematics · Mathematics 2007-05-23 Antonio J. Di Scala , Martin Sombra

We analyze sumsets A+B = {a+b : a in A, b in B} where A,B are sets of integers, A is infinite, and B has positive upper Banach density. For each k, we show that A+B contains at least the expected density of k-term arithmetic progressions…

Dynamical Systems · Mathematics 2010-11-23 John T. Griesmer

Let $f(n)$ be the number of distinct exponents in the prime factorization of the natural number $n$. We prove some results about the distribution of $f(n)$. In particular, for any positive integer $k$, we obtain that $$ \#\{n \leq x : f(n)…

Number Theory · Mathematics 2020-12-15 Carlo Sanna
‹ Prev 1 4 5 6 7 8 10 Next ›