Related papers: On the density of primes in arithmetic progression…

Numerical evidence suggests that for only about $2\%$ of pairs $p,p+2$ of twin primes, $p+2$ has more primitive roots than does $p$. If this occurs, we say that $p$ is exceptional (there are only two exceptional pairs with $5 \leq p \leq…

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$…

Consider any nonzero univariate polynomial with rational coefficients, presented as an elementary algebraic expression (using only integer exponents). Letting sigma(f) denotes the additive complexity of f, we show that the number of…

We develop a unified density-based framework for primality, coprimality, and prime pairs, and introduce an intrinsic normalized model for prime gaps constrained by the Prime Number Theorem. Within this setting, a structural tension between…

We give a formula for the density of $0$ in the sequence of generalized Motzkin numbers, $M^{a, b}_n$, modulo a prime, $p$, in terms of the first $p$ generalized central trinomial coefficients $T^{a, b}_n\bmod p$ (with $n<p$). We apply our…

The effective version of Chebotarev's density theorem under the Generalized Riemann Hypothesis and the Artin conjecture (cf. Iwaniec and Kowalski's Analytic Number Theory, 5.13) involves a numerical invariant of a subset $D$ of a finite…

Let $\delta(p)$ tend to zero arbitrarily slowly as $p\to\infty$. We exhibit an explicit set $\mathcal{S}$ of primes $p$, defined in terms of simple functions of the prime factors of $p-1$, for which the least primitive root of $p$ is $\le…

The Bergelson-Leibman theorem states that if P_1, ..., P_k are polynomials with integer coefficients, then any subset of the integers of positive upper density contains a polynomial configuration x+P_1(m), ..., x+P_k(m), where x,m are…

In this paper, we study an asymptotic distribution of sets of primes satisfying certain "linking conditions" in arithmetic topology, namely, conditions given by the Legendre and R\'edei symbols among sets of primes. As our Main Theorem, we…

In 1997 H.G.Diamond gave a condition on Beurling's generalized prime numbers in order that the corresponding generalized integers have a density. We give a new proof of this condition (Theorem 1) and a proof that it is not necessary…

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…

Let $p$ be a sufficiently large prime number, $r$ be any given positive integer. Suppose that $a_1,\,\dots,\,a_r$ are pairwise distinct and not zero modulo $p$. Let $N(a_1,\,\dots,\,a_r;\,p)$ denote the number of…

We compute the density of the set of ordinary primes of an abelian surface over a number field in terms of the l-adic monodromy group. Using the classification of l-adic monodromy groups of abelian surfaces by Fite, Kedlaya, Rotger, and…

A famous conjecture of Artin states that there are infinitely many prime numbers for which a fixed integer $g$ is a primitive root, provided $g \neq -1$ and $g$ is not a perfect square. Thanks to work of Hooley, we know that this conjecture…

Given a polynomial f(z) = z^d + c over a global field K and a_0 in K, we study the density of prime ideals of K dividing at least one element of the orbit of a_0 under f. The density of such sets for linear polynomials has attracted much…

A monogenic polynomial $f$ is a monic irreducible polynomial with integer coefficients which produces a monogenic number field. For a given prime $q$, using the Chebotarev density theorem, we will show the density of primes $p$, such that…

A primitive root modulo an integer $n$ is the generator of the multiplicative group of integers modulo $n$. Gauss proved that for any prime number $p$ greater than $3$, the sum of its primitive roots is congruent to $1$ modulo $p$ while its…

Many famous integer sequences including the Catalan numbers and the Motzkin numbers can be expressed in the form $ConstantTermOf\left[P(x)^nQ(x)\right]$ for Laurent polynomials $Q$, and symmetric Laurent trinomials $P$. In this paper we…

In this paper we show that certain sets are dense in $\mathbb{R}$. We give some applications. For example, we show an analytical proof that $q^{\frac{1}{n}}$, $q$ is a prime number and $e$; are irrational numbers. As another application we…

Let $d \ge 3$ be an integer and let $P \in \mathbb{Z}[x]$ be a polynomial of degree $d$ whose Galois group is $S_d$. Let $(a_n)$ be a linearly recuresive sequence of integers which has $P$ as its characteristic polynomial. We prove, under…