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 algorithm; integers free of large prime factors; integer factoring; psixyology; discrete logarithm algorithms; Hildebrandt-Tennenbaum approximation

Mathematics Subject Classification ID

11Y16: Number-theoretic algorithms; complexity

11N25: Distribution of integers with specified multiplicative constraints

11Y05: Factorization

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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