Prime values of polynomials and irreducibility testing
HTML articles powered by AMS MathViewer
- by Kevin S. McCurley PDF
- Bull. Amer. Math. Soc. 11 (1984), 155-158
References
- Leonard M. Adleman and Andrew M. Odlyzko, Irreducibility testing and factorization of polynomials, Math. Comp. 41 (1983), no. 164, 699–709. MR 717715, DOI 10.1090/S0025-5718-1983-0717715-6
- Leonard M. Adleman, Carl Pomerance, and Robert S. Rumely, On distinguishing prime numbers from composite numbers, Ann. of Math. (2) 117 (1983), no. 1, 173–206. MR 683806, DOI 10.2307/2006975
- Paul T. Bateman and Roger A. Horn, A heuristic asymptotic formula concerning the distribution of prime numbers, Math. Comp. 16 (1962), 363–367. MR 148632, DOI 10.1090/S0025-5718-1962-0148632-7
- Paul T. Bateman and Roger A. Horn, Primes represented by irreducible polynomials in one variable, Proc. Sympos. Pure Math., Vol. VIII, Amer. Math. Soc., Providence, R.I., 1965, pp. 119–132. MR 0176966
- John Brillhart, Note on irreducibility testing, Math. Comp. 35 (1980), no. 152, 1379–1381. MR 583515, DOI 10.1090/S0025-5718-1980-0583515-0 6. V. Bouniakowski, Sur les diviseurs numeriques invariables des fonctions rationelles entieres, Mem. Acad. Sci. St. Petersburg 6 (1857), 305-329.
- A. K. Lenstra, H. W. Lenstra Jr., and L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), no. 4, 515–534. MR 682664, DOI 10.1007/BF01457454
- Carl Pomerance, A note on the least prime in an arithmetic progression, J. Number Theory 12 (1980), no. 2, 218–223. MR 578815, DOI 10.1016/0022-314X(80)90056-6
Additional Information
- Journal: Bull. Amer. Math. Soc. 11 (1984), 155-158
- MSC (1980): Primary 10H20, 12A20, 68C25
- DOI: https://doi.org/10.1090/S0273-0979-1984-15247-9
- MathSciNet review: 741729