中文
相关论文

相关论文: Uniform Bounds for the Least Almost-Prime Primitiv…

200 篇论文

We provide a uniform bound on the partial sums of multiplicative functions under very general hypotheses. As an application, we give a nearly optimal estimate for the count of $n \le x$ for which the Alladi-Erd\H{o}s function $A(n) =…

数论 · 数学 2025-08-13 Paul Pollack , Akash Singha Roy

We consider an analogue of Artin's primitive root conjecture for units in real quadratic fields. Given such a nontrivial unit, for a rational prime p which is inert in the field the maximal order of the unit modulo p is p+1. An extension of…

数论 · 数学 2007-05-23 Joseph Cohen

Let $g(p)$ denote the least primitive root modulo $p$, and $h(p)$ the least primitive root modulo $p^2$. We computed $g(p)$ and $h(p)$ for all primes $p\le 10^{16}$. Here we present the results of that computation and prove three theorems…

数论 · 数学 2024-11-13 Kevin J. McGown , Jonathan P. Sorenson

We present a short, self-contained, and purely combinatorial proof of Linnik's theorem: for any $\varepsilon > 0$ there exists a constant $C_\varepsilon$ such that for any $N$, there are at most $C_\varepsilon$ primes $p \leqslant N$ such…

For positive integers $q$, Dirichlet's theorem states that there are infinitely many primes in each reduced residue class modulo $q$. A stronger form of the theorem states that the primes are equidistributed among the $\varphi(q)$ reduced…

数论 · 数学 2019-08-21 David Wu

We study certain aspects of the Selberg sieve, in particular when sifting by rather thin sets of primes. We derive new results for the lower bound sieve suited especially for this setup and we apply them in particular to give a new…

数论 · 数学 2022-06-08 John Friedlander , Henryk Iwaniec

We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$. Our main result shows that the primes are equidistributed for a fixed residue class over all moduli of size $x^{1/2+\delta}$ with a…

数论 · 数学 2021-04-07 James Maynard

Let $q\ne \pm1,v^2$ be a fixed integer, and let $x\geq 1$ be a large number. The least prime number $p \geq3 $ such that $q$ is a primitive root modulo $p$ is conjectured to be $p\ll (\log q)(\log \log q)^3),$ where $\gcd(p,q)=1$. This note…

综合数学 · 数学 2021-11-16 N. A. Carella

We make many new observations on primitive roots modulo primes. For an odd prime $p$ and an integer $c$, we establish a theorem concerning $\sum_g(\frac{g+c}p)$, where $g$ runs over all the primitive roots modulo $p$ among $1,\ldots,p-1$,…

数论 · 数学 2020-03-02 Zhi-Wei Sun

We consider the distribution in residue classes modulo primes $p$ of Euler's totient function $\phi(n)$ and the sum-of-proper-divisors function $s(n):=\sigma(n)-n$. We prove that the values $\phi(n)$, for $n\le x$, that are coprime to $p$…

数论 · 数学 2021-05-28 Noah Lebowitz-Lockard , Paul Pollack , Akash Singha Roy

By establishing an improved level of distribution we study almost primes of the form $f(p,n)$ where $f$ is an irreducible binary form over $\mathbb Z$.

数论 · 数学 2015-09-23 A. J. Irving

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

群论 · 数学 2018-03-15 S. P. Glasby , Cheryl E. Praeger , Kyle Rosa , Gabriel Verret

For A,epsilon>0 and any sufficiently large odd n we show that for almost all k up to n^{1/5-epsilon} there exists a representation n=p1+p2+p3 with primes in residue classes b1,b2,b3 mod k for almost all admissible triplets b1,b2,b3 of…

数论 · 数学 2007-09-12 Karin Halupczok

A Lehmer number modulo a prime $p$ is an integer $a$ with $1 \leq a \leq p-1$ whose inverse $\bar{a}$ within the same range has opposite parity. Lehmer numbers that are also primitive roots have been discussed by Wang and Wang in an…

数论 · 数学 2017-12-13 Stephen D. Cohen , Tim Trudgian

A classical problem in analytic number theory is to study the distribution of $\alpha p$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes $p$ such that $p+2$ is…

数论 · 数学 2007-11-07 T. L. Todorova , D. I. Tolev

For a prime number $p$ and a sequence of integers $a_0,\dots,a_k\in \{0,1,\dots,p\}$, let $s(a_0,\dots,a_k)$ be the minimum number of $(k+1)$-tuples $(x_0,\dots,x_k)\in A_0\times\dots\times A_k$ with $x_0=x_1+\dots + x_k$, over subsets…

组合数学 · 数学 2019-03-13 Ostap Chervak , Oleg Pikhurko , Katherine Staden

In this work and its sister paper [5] we give a new proof of the famous Linnik theorem bounding the least prime in an arithmetic progression. Using sieve machinery in both papers, we are able to dipense with the log-free zero density bounds…

数论 · 数学 2023-03-13 John B Friedlander , Henryk Iwaniec

Let $E/\mathbb{Q}$ be an elliptic curve with complex multiplication (CM), and for each prime $p$ of good reduction, let $a_E(p) = p + 1 - \#E(\mathbb{F}_p)$ denote the trace of Frobenius. By the Hasse bound, $a_E(p) = 2\sqrt{p} \cos…

数论 · 数学 2016-08-16 Evan Chen , Peter S. Park , Ashvin Swaminathan

This paper proposes lower bounds on a quantity called $L^p$-norm joint spectral radius, or in short, $p$-radius, of a finite set of matrices. Despite its wide range of applications to, for example, stability analysis of switched linear…

最优化与控制 · 数学 2016-11-04 Masaki Ogura , Victor M. Preciado , Raphaël Jungers

Many upper bounds for the moduli of polynomial roots have been proposed but reportedly assessed on selected examples or restricted classes only. Regarding quality measured in terms of worst-case relative overestimation of the maximum…

数值分析 · 数学 2024-11-26 Prashant Batra