Lower bounds for the number of smooth values of a polynomial (1998)

by Greg Martin
Citations:3 - 1 self

Active Bibliography

21 Smooth numbers: computational number theory and beyond – Andrew Granville - 2008
Divisibility, Smoothness and Cryptographic Applications – David Naccache, Igor E. Shparlinski - 2008
10 An asymptotic formula for the number of smooth values of a polynomial – Greg Martin - 1999
5 On values taken by the largest prime factor of shifted primes – William D. Banks, Igor E. Shparlinski
15 The distribution of totients – Kevin Ford - 1998
Small – unknown authors
10 200?), Small gaps between products of two primes – D. A. Goldston, S. W. Graham, J. Pintz, C. Y. Yildirim
4 COMMON VALUES OF THE ARITHMETIC FUNCTIONS φ AND σ – Kevin Ford, Florian Luca, Carl Pomerance
3 Arbitrarily Tight Bounds On The Distribution Of Smooth Integers – Daniel J. Bernstein - 2002
BINARY FORMS AS SUMS OF TWO SQUARES AND CHÂTELET SURFACES – R. De La Bretèche, T. D. Browning
Wild and Wooley Numbers – Jeffrey C. Lagarias - 2005
Grimm’s Conjecture and Smooth Numbers – Shanta Laishram, M. Ram Murty - 2012
8 Integers, without large prime factors, in arithmetic progressions, II – Andrew Granville
6 Residue classes free of values of Euler’s function – Kevin Ford, Sergei Konyagin, Carl Pomerance - 1999
ON PRIMITIVE DIVISORS OF n 2 + b – Graham Everest, Glyn Harman - 2007
6 Primes Generated by Recurrence Sequences – G. Everest, S. Stevens, D. Tamsett, T. Ward - 2006
15 Explicit Bounds on Exponential Sums and the Scarcity of Squarefree Binomial Coefficients – Andrew Granville, Olivier Ramaré - 1996
An Overview of Sieve Method and its History – Yoichi Motohashi - 2005
In this paper we consider the exponential sum – Kaisa Matomäki