Selected Papers 427
David W. Boyd, The diophantine equation x2 + y”’ = 2”’
Amer. Math. Monthly 95 (1988), 544-547. [M l]
Louis Brand, The roots of a quaternion
Amer. Math. Monthly 49 (1942), 519-520.
Rolf Brandl, Integer polynomials that are reducible modulo all primes
Amer. Math. Monthly 93 (1986), 286-288. [A 31J.L. Brenner & R.C. Lyndon, Proof of the fundamental theorem of algebra
Amer. Math. Monthly 88 (1981), 253-256. [M 41
Louis Brickman, On nonnegative polynomials
Amer. Math. Monthly 69 (1962), 218-221. [M l]
J.R. Britton, A note on polynomial curves
Amer. Math. Monthly 42 (1935), 306-310. [M 21
Duane Broline, Renumbering the faces of dice
Math. Magazine 52 (1979), 312-315. [E 31
W.S. Brown, Reducibility properties of polynomials over the rationals
Amer. Math. Monthly 70 (1963), 965-969. [A 3]
R. Creighton Buck, Sherlock Holmes in Babylon
Amer. Math. Monthly 8’7 (1980), 335-345. [E l]
polynomial identities to generate Pythagorean triples
F.J. Budden, Functions which permute the roots of an equation
Math. Gaz. 60 (1976), 24-38. [M 61
Sylvan Burgstahler, An algorithm for solving polynomial equations
Amer. Math. Monthly 93 (1986), 421-430. [M 51
R. Butler, The rapid factorization to high accuracy of quartic expressions
Amer. Math. Monthly 69 (1962), 138-141. [M 31
D.G. Cantor, Irreducible polynomials with integral coefficients have suc-
cinct certificates
J. Algorithms 2 (1981), 385-392, MR 83a:12003. [A 31
D.G. Cantor & H. Zassenhaus, A new algorithm for factoring polynomials
over finite fields
Math. Comp. 36 (1981), 587-592, MR 82e:12020. [A 31
L. Carlitz & J.M. Thomas, Rational tabulated values of trigonometric func-
tions
Amer. Math. Monthly 69 (1962), 789-793. [M l]
F.W. Carroll, A polynomial in each variable separately is a polynomial
Amer. Math. Monthly 68 (1961), 42. [M 1,2]
Roger Chalkley, Cardan’s formula and biquadratic equations
Math. Mug. 47 (1974), 8-14. [M l]
Geng-Zhe Chang, Bernstein polynomials via the shifting operator
Amer. Math. Monthly 91 (1984), 634-638. [M 71