Lower bounds for the number of smooth values of a polynomial, electronic preprint available online at http://xxx.lanl.gov/abs/math.NT/9807102 (1998)

by Greg Martin
Citations:2 - 1 self

Documents Related by Co-Citation

61 There are infinitely many Carmichael numbers – W. R. Alford, Andrew Granville, Carl Pomerance - 1982
5 A note on polynomial congruences, Recent Progress in Analytic Number Theory – M N Huxley - 1979
10 Limitations to the equi-distribution of primes – J Friedlander, A Granville - 1989
2 Généralisation d’un théorème de Tchebycheff – T Nagel - 1921
5 Polynomial values free of large prime factors – C Dartyge, G Martin, G Tenenbaum
43 Sur certaines hypotheses concernant les nombres premiers – A Schinzel, W Sierpinski - 1959
44 A heuristic asymptotic formula concerning the distribution of prime numbers – P Bateman, R Horn - 1962
126 Sieve methods – H Halberstam, H-E Richert - 1974
24 A new extension of Dirichlet’s theorem on prime numbers – L E Dickson - 1904
36 Integers without large prime factors – A Hildebrand, G Tenenbaum - 1993
6 Short sums of certain arithmetic functions – M Nair, G Tenenbaum - 1998
26 Das asymptotische Verhalten von Summen über multiplikative Funktionen – E Wirsing - 1961
112 Some problems of ‘Partitio numerorum’; III: On the expression of a number as a sum of primes – G H Hardy, J E Littlewood
7 On the number of solutions of polynomial congruences and Thue equations – C L Stewart - 1991
1 os: On pseudoprimes and Carmichael numbers – P Erd - 1956
1 Frobenius pseudoprimes, preprint – J Grantham - 1997
1 o: On generalized Lucas pseudoprimes – I Jo' - 1990
1 uller: Carmichael numbers and Lucas tests, pp. 193--202 – S M S M - 1998
1 Pinch: The Carmichael numbers up to 10 – R G E - 1993