Integers, without large prime factors, in arithmetic progressions. I
From MaRDI portal
Publication:1309360
DOI10.1007/BF02392787zbMATH Open0784.11045OpenAlexW2068484936MaRDI QIDQ1309360FDOQ1309360
Authors: Andrew Granville 
Publication date: 9 March 1994
Published in: Acta Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02392787
Recommendations
- Prime numbers with a given value of their least quadratic non-residue
- Integers without divisors in a given progression
- The Distribution of Smooth Numbers in Arithmetic Progressions
- The distribution of quadratic residues and nonresidues in arithmetic progressions
- Densities in certain three-way prime number races
- On the number of positive integers \(\leq x\) and free of prime factors \(>y\)
- A remark about the orders of \(2\pmod u\) where \(u\) is an odd number
- On pairs of coprime integers with no large prime factors
- Power nonresidues modulo a prime number in a special greatest integer-sequence
- scientific article; zbMATH DE number 24999
arithmetic progressionuniformityintegers without large prime factorsDickman functionBombieri-Vinogradov type result
Cites Work
- A new iterative method in Waring's problem
- Title not available (Why is that?)
- Entiers Sans Grand Facteur Premier En Progressions Arithmetiques
- On the number of positive integers \(\leq x\) and free of prime factors \(>y\)
- Title not available (Why is that?)
- The Difference between Consecutive Prime Numbers
- Title not available (Why is that?)
- Sur le nombre des entiers sans grand facteur premier. (On the number of integers without large prime factor)
- On Integers Free of Large Prime Factors
- The distribution of quadratic residues and non‐residues
- Numbers with small prime factors, and the least 𝑘th power non-residue
- Title not available (Why is that?)
- The Distribution of Smooth Numbers in Arithmetic Progressions
- An Elementary Proof of the Prime-Number Theorem for Arithmetic Progressions
- Multiplicative Functions on Arithmetic Progressions
- Multiplicative functions on arithmetic progressions, II.
- Asymptotic Estimates of Sums Involving the Moebius Function. II
- An improvement of Selberg's sieve method I
- A property of the counting function of integers with no large prime factors
- Integers without large prime factors, II
- On the number of prime factors of integers without large prime divisors
Cited In (20)
- Smooth numbers and the Dickman \(\rho\) function
- Numbers in a given set with (or without) a large prime factor
- Répartition Statistique Des Entiers Sans Grand Facteur Premier Dans Les Progressions Arithmétiques
- The distribution in residue classes of integers omitting unspecified prime divisors
- Fouvry-Iwaniec type theorems on friable integers
- An interval result for the number field \(\psi{}(x,y)\) function
- Some remarks on nonnegative multiplicative functions on arithmetic progressions
- Integers without large prime factors
- The distribution of smooth numbers in arithmetic progressions
- Smooth values of shifted primes in arithmetic progressions
- Character sums with exponential functions over smooth numbers
- Numbers with small prime factors, and the least 𝑘th power non-residue
- Integers, without large prime factors, in arithmetic progressions. II
- Rigorous analysis of a randomised number field sieve
- On the asymptotic behavior of the Dickman-de Bruijn function
- On a paper of K. Soundararajan on smooth numbers in arithmetic progressions
- Primes in progressions to moduli with a large power factor
- The Distribution of Smooth Numbers in Arithmetic Progressions
- Integers without large prime factors in short intervals and arithmetic progressions
- On a conjecture of Soundararajan
This page was built for publication: Integers, without large prime factors, in arithmetic progressions. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309360)
