English
Related papers

Related papers: Erd\H{o}s inequality for primitive sets

200 papers

Let us denote the nth difference between consecutive primes by d_n. The Prime Number Theorem clearly implies that d_n is logn on average. Paul Erd\H{o}s conjectured about 60 years ago that the sequence d_n/logn is everywhere dense on the…

Number Theory · Mathematics 2015-10-16 János Pintz

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

History and Overview · Mathematics 2022-02-03 Devendra Prasad

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider…

Number Theory · Mathematics 2011-08-26 Michael Coons

Let $\omega(n)$ (resp. $\Omega(n)$) denote the number of prime divisors (resp. with multiplicity) of a natural number $n$. In 1917, Hardy and Ramanujan proved that the normal order of $\omega(n)$ is $\log\log n$, and the same is true of…

Number Theory · Mathematics 2015-09-15 Lee Troupe

Let $A$ be a set in an abelian group $G$. For integers $h,r \geq 1$ the generalized $h$-fold sumset, denoted by $h^{(r)}A$, is the set of sums of $h$ elements of $A$, where each element appears in the sum at most $r$ times. If…

Number Theory · Mathematics 2015-04-01 Francesco Monopoli

Let $z\ne \pm1,w^2$ be a fixed integer, and let $f(t)\ne g(t)^2$ be a fixed polynomial over the integers. It is shown that the subset of primes $p\geq 2$ such that $z$ and $f(z)$ is a pair of simultaneous primitive roots modulo $p$ has…

General Mathematics · Mathematics 2022-04-06 N. A. Carella

Let A be a finite nonempty subset of an additive abelian group G, and let \Sigma(A) denote the set of all group elements representable as a sum of some subset of A. We prove that |\Sigma(A)| >= |H| + 1/64 |A H|^2 where H is the stabilizer…

Number Theory · Mathematics 2015-06-26 Matt DeVos , Luis Goddyn , Bojan Mohar , Robert Samal

A solution $(x,y,z) \in \mathbb{Z}^3-\{(0,0,0)\}$ to a generalized Fermat equation \[ Ax^a + By^b + Cz^c = 0, \] is called \emph{primitive} if $\gcd(x,y,z) = 1$. By work of Beukers, we know that in the \emph{spherical} regime (that is, when…

Number Theory · Mathematics 2026-05-28 Santiago Arango-Piñeros

In this paper analyzes \textit{The Erd\H{o}s-Straus conjecture} asserts that $f$$(n)$ $>$ 0 for every $n$ $\geq$ 2, where $f(n)$ indicates the number of solutions to the Diophantine Equation…

General Mathematics · Mathematics 2016-09-02 Elias Rios

We count primitive lattices of rank $d$ inside $\mathbb{Z}^{n}$ as their covolume tends to infinity, with respect to certain parameters of such lattices. These parameters include, for example, the subsapce that a lattice spans, namely its…

Number Theory · Mathematics 2021-10-29 Tal Horesh , Yakov Karasik

In 2007, Zhi-Wei Sun defined a \emph{covering number} to be a positive integer $L$ such that there exists a covering system of the integers where the moduli are distinct divisors of $L$ greater than 1. A covering number $L$ is called…

Number Theory · Mathematics 2014-06-27 Lenny Jones , Daniel White

Let $\{a_1, . . . , a_n\}$ be a set of positive integers with $a_1 < \dots < a_n$ such that all $2^n$ subset sums are distinct. A famous conjecture by Erd\H{o}s states that $a_n>c\cdot 2^n$ for some constant $c$, while the best result known…

Combinatorics · Mathematics 2022-10-31 Simone Costa , Marco Dalai , Stefano Della Fiore

Let $G$ be a finite primitive permutation group on a set $\Omega$ with nontrivial point stabilizer $G_{\alpha}$. We say that $G$ is extremely primitive if $G_{\alpha}$ acts primitively on each of its orbits in $\Omega \setminus \{\alpha\}$.…

Group Theory · Mathematics 2020-11-26 Timothy C. Burness , Adam R. Thomas

We illustrate how elementary information-theoretic ideas may be employed to provide proofs for well-known, nontrivial results in number theory. Specifically, we give an elementary and fairly short proof of the following asymptotic result:…

Information Theory · Computer Science 2007-11-06 Ioannis Kontoyiannis

Our work is motivated by the fact that the norms of the Eulerian integers are related to the sums of form $a^2-ab+b^2$, providing a natural generalization for problems concerning products over sums or differences of integers. Let $E$ be the…

Number Theory · Mathematics 2026-02-10 Erik Füredi , Katalin Gyarmati

We study the distribution of prime numbers under the unlikely assumption that Siegel zeros exist. In particular we prove for \[ \sum_{n \leq X} \Lambda(n) \Lambda(\pm n+h) \] an asymptotic formula which holds uniformly for $h = O(X)$. Such…

Number Theory · Mathematics 2022-02-08 Kaisa Matomäki , Jori Merikoski

A set of nonnegative matrices $\mathcal{M}=\{M_1, M_2, \ldots, M_k\}$ is called primitive if there exist indices $i_1, i_2, \ldots, i_m$ such that $M_{i_1} M_{i_2} \ldots M_{i_m}$ is positive (i.e. has all its entries $>0$). The length of…

Formal Languages and Automata Theory · Computer Science 2016-02-25 Balázs Gerencsér , Vladimir V. Gusev , Raphaël M. Jungers

Let $A$ be an absolutely simple abelian surface defined over a number field $K$ with a commutative (geometric) endomorphism ring. Let $\pi_{A, \text{split}}(x)$ denote the number of primes $\mathfrak{p}$ in $K$ such that each prime has norm…

Number Theory · Mathematics 2023-09-12 Tian Wang

Let $\omega(n)$ denote the number of distinct prime factors of a natural number $n$. In 1940, Erd\H{o}s and Kac established that $\omega(n)$ obeys the Gaussian distribution over natural numbers, and in 2004, the third author generalized…

Number Theory · Mathematics 2025-06-04 Sourabhashis Das , Wentang Kuo , Yu-Ru Liu

A famous conjecture of Artin asserts that any integer $a$ that is neither $-1$ nor a square should be a primitive root (mod $p$) for a positive proportion of primes $p$. Moreover, using a heuristic argument, Artin guessed an explicit…

Number Theory · Mathematics 2025-02-28 Leo Goldmakher , Greg Martin , Paul Péringuey