An effective lower bound sieve for friable numbers
From MaRDI portal
Cites work
- An asymptotic formula for the number of smooth values of a polynomial
- Arithmetic functions and irreducible binary forms of degree 3
- Averaged forms of two conjectures of Erdős and Pomerance, and their applications
- Entiers friables dans des progressions arithmétiques de grand module
- Entiers Sans Grand Facteur Premier En Progressions Arithmetiques
- Fouvry-Iwaniec type theorems on friable integers
- Friability of the values of a polynomial
- Friable values of a quadratic and a linear form
- Friable values of binary forms
- Généralisation d'un théorème de Tchebycheff.
- scientific article; zbMATH DE number 3467229 (Why is no real title available?)
- scientific article; zbMATH DE number 3207382 (Why is no real title available?)
- scientific article; zbMATH DE number 3226335 (Why is no real title available?)
- Integers of the form \(n^ 2+1\) without large prime factors
- Integers without large prime factors
- Integers, without large prime factors, in arithmetic progressions. I
- Integers, without large prime factors, in arithmetic progressions. II
- Large prime factors of binary forms
- Level of distribution of quadratic polynomials and an upper bound sieve for friable integers
- On a Conjecture of Balog
- On a paper of K. Soundararajan on smooth numbers in arithmetic progressions
- On the divisor-sum problem for binary forms
- On the frequency of numbers containing prime factors of a certain relative magnitude.
- On the greatest prime factor of \((n^2)+1\)
- On the greatest prime factor of a quadratic polynomial
- On the largest prime factor of n^2 + 1
- On the largest prime factors of \(n\) and \(n+1\)
- On the number of positive integers \(\leq x\) and free of prime factors \(>y\)
- On values of \(n^2 + 1\) free of large prime factors
- Opera de cribro
- Polynomial values free of large prime factors
- Répartition Statistique Des Entiers Sans Grand Facteur Premier Dans Les Progressions Arithmétiques
- Some mathematical remarks on the polynomial selection in NFS
- Statistical properties of friable integers
- Sur le nombre des entiers sans grand facteur premier. (On the number of integers without large prime factor)
- The distribution of smooth numbers in arithmetic progressions
- Three conjectures on \(P^+(n)\) and \(P^+(n+1)\) hold under the Elliott-Halberstam conjecture for friable integers
- Two problems on the greatest prime factor of \(n^2+1\)
- Über die mittlere Verteilung der Werte zahlentheoretischer Funktionen auf Restklassen. I
Cited in
(1)
This page was built for publication: An effective lower bound sieve for friable numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6900363)
