The average least witness is 2

Ronald Joseph Burthe Jr.

Acta Arithmetica, Tome 80 (1997), p. 327-341 / Harvested from The Polish Digital Mathematics Library

Détail

Publié le : 1997-01-01

Zbl 0874.11011

EUDML-ID : urn:eudml:doc:207047

Bibliographie

[000] [AGP] W. R. Alford, A. Granville and C. Pomerance, On the difficulty of finding reliable witnesses, in: L. M. Adleman and M. D. Huang (eds.), Algorithmic Number Theory, Lecture Notes in Comput. Sci. 877, Springer, Berlin, 1994, 1-16. | Zbl 0828.11074

[001] [B] E. Bach, Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms, MIT Press, Cambridge, Mass., 1985. | Zbl 0572.10001

[002] [Bo] E. Bombieri, On the large sieve, Mathematika 12 (1965), 201-225. | Zbl 0136.33004

[003] [Bu] D. A. Burgess, On character sums and L-series II, Proc. London Math. Soc. 13 (1963), 524-536. | Zbl 0123.04404

[004] [BE] D. A. Burgess and P. D. T. A. Elliott, The average of the least primitive root, Mathematika 15 (1968), 39-50. | Zbl 0174.08105

[005] [Bur] R. J. Burthe Jr., Upper bounds for least witnesses and generating sets, this volume, 311-326.

[006] [C] M. D. Coleman, On the equation b₁p - b₂P₂ = b₃, J. Reine Angew. Math. 403 (1990), 1-66.

[007] [D] H. Davenport, Multiplicative Number Theory, 2nd ed., Springer, New York, 1980. | Zbl 0453.10002

[008] [E1] P. Erdős, On pseudoprimes and Carmichael numbers, Publ. Math. Debrecen 4 (1956), 201-206. | Zbl 0074.27105

[009] [E2] P. Erdős, On the integers relatively prime to n and on a number theoretic function considered by Jacobsthal, Math. Scand. 10 (1962), 163-170. | Zbl 0202.33002

[010] [G] P. X. Gallagher, A large sieve density estimate near σ = 1, Invent. Math. 11 (1970), 329-339. | Zbl 0219.10048

[011] [HB] D. R. Heath-Brown, The density of zeros of Dirichlet's L-functions, Canad. J. Math. 31 (1979), 231-240.

[012] [H] C. Hooley, On the difference of consecutive numbers prime to n, Acta Arith. 8 (1963), 343-347. | Zbl 0121.04706

[013] [I] H. Iwaniec, On the problem of Jacobsthal, Demonstratio Math. 11 (1978), 225-231. | Zbl 0378.10029

[014] [Ju1] M. Jutila, A statistical density theorem for L-functions with applications, Acta Arith. 16 (1969), 207-216.

[015] [Ju2] M. Jutila, On Linnik's constant, Math. Scand. 41 (1977), 45-62. | Zbl 0363.10026

[016] [Ju3] M. Jutila, Zero-density estimates for L-functions, Acta Arith. 32 (1977), 55-62.

[017] [LMO] J. L. Lagarias, H. L. Montgomery and A. M. Odlyzko, A bound for the least prime ideal in the Chebotarev density theorem, Invent. Math. 54 (1979), 271-296. | Zbl 0401.12014

[018] [M] L. Monier, Evaluation and comparison of two efficient probabilistic primality testing algorithms, Theoret. Comput. Sci. 12 (1980), 97-108. | Zbl 0443.10002

[019] [Mo1] H. L. Montgomery, Mean and large values of Dirichlet polynomials, Invent. Math. 8 (1969), 334-345. | Zbl 0204.37301

[020] [Mo2] H. L. Montgomery, Zeros of L-functions, Invent. Math., 346-354. | Zbl 0204.37401

[021] [Mo3] H. L. Montgomery, Topics in Multiplicative Number Theory, Lecture Notes in Math. 227, Springer, New York, 1971.

[022] [Mo4] H. L. Montgomery, Zeros of L-functions, Chap. 9 of: Ten Lectures on the Interface between Analytic Number Theory and Harmonic Analysis, Amer. Math. Soc., Providence, R.I., 1994, 163-178.

[023] [Mot] Y. Motohashi, Lectures on Sieve Methods and Prime Number Theory, Tata Institute of Fundamental Research, Springer, Bombay, 1983.

[024] [P1] C. Pomerance, A note on the least prime in an arithmetic progression, J. Number Theory 12 (1980), 218-223. | Zbl 0436.10020

[025] [P2] C. Pomerance, On the distribution of pseudoprimes, Math. Comp. 37 (1981), 587-593. | Zbl 0511.10002

[026] [R] M. O. Rabin, Probabilistic algorithm for testing primality, J. Number Theory 12 (1980), 128-138. | Zbl 0426.10006

[027] [Ro] K. A. Rodosskiĭ, On non-residues and zeros of L-functions, Izv. Akad. Nauk SSSR Ser. Mat. 20 (1956), 303-306 (in Russian).

[028] [Se] A. Selberg, Remarks on sieves, Proc. 1972 Number Theory Conference in Boulder, 1972, 205-216.