On the number of positive integers \(\leq x\) and free of prime factors \(>y\)
From MaRDI portal
Publication:1064343
DOI10.1016/0022-314X(86)90013-2zbMath0575.10038MaRDI QIDQ1064343
Publication date: 1986
Published in: Journal of Number Theory (Search for Journal in Brave)
lower boundasymptotic formulaintegers free of large prime factorsDickman functionshort interval estimate
Asymptotic results on arithmetic functions (11N37) Distribution of integers with specified multiplicative constraints (11N25)
Related Items
Average reciprocals of the order of \(a\) modulo \(n\) ⋮ The Most Frequent Values of the Largest Prime Divisor Function ⋮ On the distribution in short intervals of integers having no large prime factor ⋮ 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 LES PLUS GRANDS FACTEURS PREMIERS D'ENTIERS CONSÉCUTIFS ⋮ Factoring polynomials and primitive elements for special primes ⋮ On the average distribution of divisors of friable numbers ⋮ The sharp threshold for making squares ⋮ Sieving the positive integers by large primes ⋮ Constantes de Turán–Kubilius friables: une étude numérique ⋮ Some Ramanujan-Nagell equations with many solutions ⋮ Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers ⋮ Estimates for representation numbers of quadratic forms ⋮ On sums with small prime factors ⋮ Integers without large prime factors in short intervals: conditional results ⋮ Three conjectures on \(P^+(n)\) and \(P^+(n+1)\) hold under the Elliott-Halberstam conjecture for friable integers ⋮ Sur le nombre des entiers sans grand facteur premier. (On the number of integers without large prime factor) ⋮ Densité des friables ⋮ 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 ⋮ Friable values of Piatetski-Shapiro sequences ⋮ Rough values of Piatetski-Shapiro sequences ⋮ Another Generalization of Wiener’s Attack on RSA ⋮ Some problems about friable numbers in Piatetski-Shapiro sequence ⋮ Gauss circle problem over smooth integers ⋮ On the friable mean-value of the Erdős-Hooley delta function ⋮ 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 ⋮ Extreme values of derivatives of zeta and L‐functions ⋮ A problem of Erdős–Graham–Granville–Selfridge on integral points on hyperelliptic curves ⋮ Computing the endomorphism ring of an ordinary elliptic curve over a finite field ⋮ On the density of shifted primes with large prime factors ⋮ The multiplication table for smooth integers ⋮ Bounds for the first several prime character nonresidues ⋮ On the smooth values of shifted almost-primes ⋮ Integers with dense divisors. II ⋮ Integers without divisors from a fixed arithmetic progression ⋮ The number of coefficients of automorphic \(L\)-functions for \(\mathrm{GL}_m\) of same signs ⋮ Approximating the number of integers free of large prime factors ⋮ Distribution laws of divisors of friable integers ⋮ Performance analysis of index calculus method ⋮ Rigorous analysis of a randomised number field sieve ⋮ A new formula for Chebotarev densities ⋮ On the largest prime factor of an integer ⋮ On ideals free of large prime factors ⋮ Numbers in a given set with (or without) a large prime factor ⋮ Smooth values of shifted primes in arithmetic progressions ⋮ On Integers Free of Large Prime Factors ⋮ The Distribution of Smooth Numbers in Arithmetic Progressions ⋮ Friable integers: Turán-Kubilius inequality and applications ⋮ Average distribution of certain arithmetic functions on the set of integers without large prime factors ⋮ The behaviour in short intervals of exponential sums over sifted integers ⋮ Shifted values of the largest prime factor function and its average value in short intervals ⋮ Sur l'inégalité de Turán-Kubilius friable ⋮ Two Differential-Difference Equations Arising in Number Theory ⋮ A pair of difference differential equations of Euler-Cauchy type ⋮ An algorithm for counting smooth integers ⋮ Short intervals containing numbers without large prime factors ⋮ On multiplicative functions resembling the Möbius function ⋮ 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 ⋮ Primes in arithmetic progressions with friable indices ⋮ Estimate for the function \(\Psi_K(x,y)\) in algebraic number fields ⋮ Arithmetical semigroups. II: Sieving by large and small prime elements. Sets of multiples ⋮ Distribution Laws of Smooth Divisors ⋮ Some mathematical remarks on the polynomial selection in NFS ⋮ Smooth arithmetical sums over k-free integers ⋮ A unified and improved Chebotarev density theorem ⋮ Sieving the Positive Integers by Small Primes ⋮ Additive problems with smooth integers ⋮ Weyl sums, mean value estimates, and Waring's problem with friable numbers ⋮ Integers Divisible by the Sum of their Prime Factors ⋮ Elliott-Halberstam conjecture and values taken by the largest prime factor of shifted primes ⋮ On a result of Erdős and Ivić ⋮ 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 ⋮ Unnamed Item ⋮ Compositions with the Euler and Carmichael functions ⋮ Integers, without large prime factors, in arithmetic progressions. I ⋮ Théorèmes de type Fouvry–Iwaniec pour les entiers friables ⋮ On values taken by the largest prime factor of shifted primes ⋮ On the asymptotic behavior of the Dickman-de Bruijn function ⋮ On the largest prime factors of consecutive integers in short intervals ⋮ Integers without large prime factors ⋮ A new attack on RSA and Demytko’s elliptic curve cryptosystem
Cites Work
- On a problem of Oppenheim concerning Factorisatio Numerorum
- The number of positive integers \(\leq x\) and free of prime factors \(>y\)
- Das asymptotische Verhalten von Summen über multiplikative Funktionen. II
- APPLICATION OF SOME INTEGRAL EQUATIONS TO PROBLEMS OF NUMBER THEORY
- Numbers with small prime factors, and the least 𝑘th power non-residue
- Sur les fonctions arithmétiques multiplicatives
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item