On Integers Free of Large Prime Factors
From MaRDI portal
Publication:3735791
DOI10.2307/2000573zbMath0601.10028OpenAlexW4243458565MaRDI QIDQ3735791
Gérald Tenenbaum, Adolf Hildebrand
Publication date: 1986
Full work available at URL: https://doi.org/10.2307/2000573
Related Items (62)
On the distribution in short intervals of integers having no large prime factor ⋮ Note on a paper by A. Granville and K. Soundararajan ⋮ A sharp estimate of positive integral points in 6-dimensional polyhedra and a sharp estimate of smooth numbers ⋮ On the number of prime factors of integers without large prime divisors ⋮ Sur un problème extrémal en arithmétique. (On an extremal problem in arithmetic) ⋮ On the average distribution of divisors of friable numbers ⋮ The sharp threshold for making squares ⋮ Sieving the positive integers by large primes ⋮ Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers ⋮ On the number of prime factors of an integer ⋮ Sur le nombre des entiers sans grand facteur premier. (On the number of integers without large prime factor) ⋮ A generalization of the Buchstab equation ⋮ Explicit estimates for the distribution of numbers free of large prime factors ⋮ Level of distribution of quadratic polynomials and an upper bound sieve for friable integers ⋮ Long large character sums ⋮ On the bias of a probability law for brittle integers ⋮ Running Time Predictions for Factoring Algorithms ⋮ On the distribution of modular inverses from short intervals ⋮ Additive problems with almost prime squares ⋮ A binary additive problem with fractional powers ⋮ Some problems about friable numbers in Piatetski-Shapiro sequence ⋮ On the friable mean-value of the Erdős-Hooley delta function ⋮ On a conjecture of Soundararajan ⋮ Smooth numbers and the Dickman \(\rho\) function ⋮ Une nouvelle approche dans la théorie des entiers friables ⋮ Note on a conjecture of Hildebrand regarding friable integers ⋮ On sharp transitions in making squares ⋮ On a paper of K. Soundararajan on smooth numbers in arithmetic progressions ⋮ Smooth solutions to the \(abc\) equation: the \(xyz\) conjecture ⋮ The multiplication table for smooth integers ⋮ An asymptotic formula and some explicit estimates of the counting function of \(y\)-friable numbers ⋮ The lattice points of an \(n\)-dimensional tetrahedron ⋮ Approximating the number of integers free of large prime factors ⋮ Distribution laws of divisors of friable integers ⋮ Rigorous analysis of a randomised number field sieve ⋮ Explicit Tauberian estimates for functions with positive coefficients ⋮ Character sums with smooth numbers ⋮ On ideals free of large prime factors ⋮ Numbers in a given set with (or without) a large prime factor ⋮ Friable integers: Turán-Kubilius inequality and applications ⋮ Limit theorems for the number of summands in integer partitions ⋮ The maximum size of short character sums ⋮ An algorithm for counting smooth integers ⋮ Short intervals containing numbers without large prime factors ⋮ Entiers friables dans des progressions arithmétiques de grand module ⋮ Nicolaas Govert de Bruijn, the enchanter of friable integers ⋮ An interval result for the number field \(\psi{}(x,y)\) function ⋮ Approximating the number of integers without large prime factors ⋮ An estimate for the number of integers without large prime factors ⋮ Weyl sums, mean value estimates, and Waring's problem with friable numbers ⋮ Averaged forms of two conjectures of Erdős and Pomerance, and their applications ⋮ The Dickman–Goncharov distribution ⋮ Statistical properties of friable integers ⋮ Sums of Fourier coefficients of holomorphic cusp forms over integers without large prime factors ⋮ Integers, without large prime factors, in arithmetic progressions. I ⋮ A Smooth Selberg Sieve and Applications ⋮ On the number of semismooth integers ⋮ Oscillation Theorems for Primes in Arithmetic Progressions and for Sifting Functions ⋮ On the density of sumsets and product sets ⋮ On the asymptotic behavior of the Dickman-de Bruijn function ⋮ Integers without large prime factors ⋮ Remarks on the semigroup elements free of large prime factors
Cites Work
- On a problem of Oppenheim concerning Factorisatio Numerorum
- 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\)
- A property of the counting function of integers with no large prime factors
- On the Local Behavior of Ψ(x, y)
- The Turán-Kubilius inequality for integers without large prime factors.
- Numbers with small prime factors, and the least 𝑘th power non-residue
- The Difference between Consecutive Prime Numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On Integers Free of Large Prime Factors
