Numbers with small prime factors, and the least 𝑘th power non-residue
From MaRDI portal
Publication:5612620
DOI10.1090/memo/0106zbMath0211.37801OpenAlexW2013892149MaRDI QIDQ5612620
Publication date: 1971
Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/memo/0106
Asymptotic results on arithmetic functions (11N37) Distribution of integers in special residue classes (11N69) Distribution of integers with specified multiplicative constraints (11N25)
Related Items
The least inert prime in a real quadratic field ⋮ On the number of prime factors of integers without large prime divisors ⋮ On $abc$ and discriminants ⋮ Factoring polynomials and primitive elements for special primes ⋮ Sieving the positive integers by large primes ⋮ Fluctuations in the mean of Euler's phi function ⋮ On the First Occurrence of Values of a Character ⋮ The least quadratic non-residue ⋮ Sur le nombre des entiers sans grand facteur premier. (On the number of integers without large prime factor) ⋮ A generalization of the Buchstab equation ⋮ The Burgess inequality and the least kth power non-residue ⋮ Intermediate prime factors in specified subsets ⋮ Analytic number theory. Abstracts from the workshop held November 6--12, 2022 ⋮ On the second smallest prime non-residue ⋮ Large sieve inequality with sparse sets of moduli applied to Goldbach conjecture ⋮ Fast norm computation in smooth-degree abelian number fields ⋮ A remark on the Dirichlet values of a completely reducible polynomial \(\pmod p\) ⋮ Large sums of high‐order characters ⋮ A theorem on totally multiplicative functions ⋮ On the constant in Burgess' bound for the number of consecutive residues or non-residues ⋮ Upper bounds for sums of powers of divisor functions ⋮ The lattice points of an \(n\)-dimensional tetrahedron ⋮ Approximating the number of integers free of large prime factors ⋮ A new formula for Chebotarev densities ⋮ The least \(k\)-th power non-residue ⋮ A Probabilistic Approach to a Differential-Difference Equation Arising in Analytic Number Theory ⋮ Sums over positive integers with few prime factors ⋮ On Integers Free of Large Prime Factors ⋮ Analysis of a simple factorization algorithm ⋮ On the fractional parts of {x/n} and related sequences. II, III ⋮ On multiplicative functions resembling the Möbius function ⋮ Nicolaas Govert de Bruijn, the enchanter of friable integers ⋮ An interval result for the number field \(\psi{}(x,y)\) function ⋮ Explicit upper bounds on the least primitive root ⋮ Approximating the number of integers without large prime factors ⋮ Primes in arithmetic progressions with friable indices ⋮ An estimate for the number of integers without large prime factors ⋮ Asymptotic semismoothness probabilities ⋮ Explicit bounds for small prime nonresidues ⋮ Euler’s constant: Euler’s work and modern developments ⋮ On the first occurrence of certain patterns of quadratic residues and non-residues ⋮ The Dickman–Goncharov distribution ⋮ Unnamed Item ⋮ Sums of Fourier coefficients of holomorphic cusp forms over integers without large prime factors ⋮ Integers, without large prime factors, in arithmetic progressions. I ⋮ On the number of semismooth integers ⋮ The number of positive integers \(\leq x\) and free of prime factors \(>y\) ⋮ On the number of positive integers \(\leq x\) and free of prime factors \(>y\) ⋮ Numerical Solution of Some Classical Differential-Difference Equations ⋮ Integers without large prime factors ⋮ On the Galois theory of generalized Laguerre polynomials and trimmed exponential
