|
Prime values of polynomials and irreducibility testing
Author(s):
Kevin S.
McCurley
Journal:
Bull. Amer. Math. Soc.
11
(1984),
155-158.
MSC (1980):
Primary 10H20, 12A20, 68C25
MathSciNet review:
741729
Retrieve article in:
PDF
References |
Similar articles |
Additional information
References:
- 1.
- L. M. Adleman and A. M. Odlyzko, Irreducibility testing and factorization of polynomials, Math. Comp. 41 (1983), 699-709. MR 717715
- 2.
- L. M. Adleman, C. Pomerance and R. Rumely, On distinguishing prime numbers from composite numbers, Ann. of Math. (2) 117 (1983), 173-206. MR 683806
- 3.
- P. T. Bateman and R. Horn, A heuristic asymptotic formula concerning the distribution of prime numbers, Math Comp. 16 (1962), 363-367. MR 148632
- 4.
- P. T. Bateman and R. Horn, Primes represented by irreducible polynomials in one variable, Proc. Sympos. Pure Math., vol. 8, Amer. Math. Soc., Providence, R.I., 1965, pp. 119-135. MR 176966
- 5.
- J. Brillhart, Note on irreducibility testing, Math. Comp. 35 (1980), 1379-1381. MR 583515
- 6.
- V. Bouniakowski, Sur les diviseurs numeriques invariables des fonctions rationelles entieres, Mem. Acad. Sci. St. Petersburg 6 (1857), 305-329.
- 7.
- A. K. Lenstra, H. W. Lenstra and L. Lovasz, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515-534. MR 682664
- 8.
- C. Pomerance, A note on the least prime in an arithmetic progression, J. Number Theory 12 (1980), 218-223. MR 578815
Similar Articles:
Retrieve articles in Bulletin of the American Mathematical Society
with MSC
(1980):
10H20, 12A20, 68C25
Retrieve articles in all Journals with MSC
(1980):
10H20, 12A20, 68C25
Additional Information:
DOI:
10.1090/S0273-0979-1984-15247-9
PII:
S 0273-0979(1984)15247-9
|
