Approximating the number of integers free of large prime factors

DOI10.1090/S0025-5718-97-00874-0zbMath0885.11054MaRDI QIDQ4372649

Simon Hunter, Jonathan P. Sorenson

Publication date: 16 December 1997

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmintegers free of large prime factorsinteger factoringpsixyologydiscrete logarithm algorithmsHildebrandt-Tennenbaum approximation

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Distribution of integers with specified multiplicative constraints (11N25) Factorization (11Y05)

Related Items

Performance analysis of index calculus method ⋮ An algorithm for counting smooth integers ⋮ Approximating the number of integers without large prime factors ⋮ An estimate for the number of integers without large prime factors ⋮ On the number of semismooth integers

Cites Work

• The development of the number field sieve
• On a problem of Oppenheim concerning Factorisatio Numerorum
• On the number of positive integers \(\leq x\) and free of prime factors \(>y\)
• Integers without large prime factors
• On Integers Free of Large Prime Factors
• A sublinear additive sieve for finding prime number
• On the Numerical Solution of a Differential-Difference Equation Arising in Analytic Number Theory
• Numbers with small prime factors, and the least 𝑘th power non-residue
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item