Corrections for

A Course in Computational Number Theory

David Bressoud & Stan Wagon

page number for A Dozen Prime Mysteries should be 142

add to end of sentence: "and of opposite parity."

end of sentence is missing. It should be "for t_n in terms of a modular inverse in the d>1 case."
change "if there is some constant c" to "if, for sufficiently large N, there is some constant c"
Replace "Exactly half ....2.7)." to
In the case of just two integers a and b, exactly half of the integers
between 0 and the conductor are representable (Exercise 2.7).
change "pairwise coprime positive integers" to "positive integers with greatest common divisor equal to 1"
change the definition of Y to {0, a, 2a, 3a, ..., (p-1)a}
following the definition of Y, mod m should be mod p (twice)
note in the second line of the first piece of code, PrimeQ is used. The reader needs to be aware that this function is only guaranteed to be accurate for integers below 10^16.
2^{2^{341}-1},\cdots should be 2^{2^{341}-1}-1,\cdots
"number" should be "numbers"
"M. Cipolla, 1904" should be in boldface
assumption can be weakened to "p does not divide b^2-1".
in the displayed equation
(\gcd(n-1,p-1)-1) should be \gcd(n-1,p-1)
"perfect number" should be "perfect numbers
"Here is an" should be "Here is an outline."
"If m>0 and (a,m)=1" should be "If m>0 and gcd(a,m)=1"
the hypothesis should be that s is relatively prime to m.
"Corollary 3.21" should be "Corollary 3.8"
10^267 should be 10^100 + 267
2445 should be 245
i > 2 should be i >= 2
"positive integers $m$ that" should be "positive integers that"
There is only one prime q such that q, 2q+1, and 4q+1 are all prime (q=3). the problem should read:
Suppose q, 6q+1, and 12q+1 are all prime, and n = (6q+1)(12q+1). Prove that the number of strong liars for n is 18q^2. This means that if we could find arbitrarily large primes q for which 6q+1 and 12q+1 are prime (this is an open question), then the proportion of strong liars can be made arbitrarily close to 1/4 infinitely often..
the Lucas test is in 8.2, not 9.2.
"last three entries" should be "last two entries"
"commutaive" should be "commutative"
There are two extra sigmas. The third sigma on the left side, and the
parens that it corresponds to () should be deleted.
And the third sigma on the right side, and the parens that it corresponds
to () should be deleted.
as written, the code wastes time accumulating prod; corrected code can be obtained by clicking here
"As we saw in the last chapter," should be "As we saw in Chapter 4,"
"We know from Theorem 4.4" should be "We know from Theorem 4.5"
equalities should be congruences
subscript n should be r
question should conclude "when $a$ is odd."
s=e should be s >= e
"each a_i is a positive integer" should be "a_0 is a nonnegative integer and each a_i, i>= 1, is a positive integer"
Last sentence should read: "But this follows from Propositions 7.2(d) and 7.3(b)."
r in the first line should have subscript n; in the second line the first q sub n should be (q sub n) + 1
"the underlined condition" should be "the italicized condition"
..where W, X, Y, and Z denote number of ... and w, x, y, z similarly denote the cows.
"where X, Y, Z, and W denote ... and x, y, z, w similarly denote" should be "where W, X, Y, and Z denote ... and w, x, y, z similarly denote"
"because those dvidsors of are" should be "because those divisors of 2329 are"
the 4729492 in the second denominator should be 4729494
"ceiling" should be "floor", and in the displayed equation, the ceiling should be replaced by the floor
change title of theorem to "An Extension of the Classic Fermat's Little Theorem"
Last sentence should read: If $n = p^t$ and $t > 1$ then Theorem 8.6 states that $\omega(n)$ divides $p^t \pm p^{t-1}$, and $p^t \pm 1$ divides $p^t \pm p^{t-1}$ if and only if $t = 1$.
in the displayed equation, replace a and b by alpha and overline{alpha}, respectively
Exer. 1.39 should be 1.38
\alpha^{n-\epsilon(n)}\equiv 2Q
should be \alpha^{n-\epsilon(n)}\equiv Q^{\frac{1-\epsilon(n)}2}
"..., n+1" should be "..., n-epsilon(n)"
1, 2, 3, ..., 156 should be 1, 2, 3, ... 155
change "convergent" to "convergence"
+- alpha or +- i alpha is a rational prime congruent to 3 (mod 4), or
change "But D.Gordon and G.Rodemich[GR] found ..." to "But N. Jarvis (see [GR]) found ..."
change (Gordon and Rodemich [GR]) to (N. Jarvis; see [GR])
publication year should be 1999

Thanks to Ellen Gethner, Jeff Shallit , Kevin Ford, Gove Effinger, Duncan Buell , Peter Hackman, Jon Mormino, Jeff Nunemacher, Shareef Tayara, Yuri Matijasevic, Raymund Breu, Zhang Zhenxiang, Jacob Bond, Eric Weisser, Beltraminelli Stefano, and Marvin Schaefer for help in finding errors.