In a spirit of wild generosity, I am offering $1 to the first finder of
each typo in the printed version of our textbook. (I would make the same offer
for the online version, but this might somehow get completely scrambled, and I would
be out a bundle!)
Current list of known typos
p.3, l.4: "exculsive" -> "exclusive" (Ron Graham - 3/15/05)
p.2 l. 30: "only only" -> "on only" (Mark Gahagan - 3/31/05)
p.84 l. 27: "reult" -> "result" (Mark Gahagan - 3/31/05)
p.93 l.7: "case case" -> "case" (Mark Gahagan - 3/31/05)
p.2 footnote: "a set with t?" -> "a set with t elements" (Steve Butler - 4/3/05)
p.3 l. 24: "let call this" -> "let's call this" (Steve Butler - 4/3/05)
p. 11 third bullet: "38659886477" -> "3865988647" (Steve Butler - 4/3/05)
p. 22 problem 2.11: On this problem it should be indicated whether the digits are listed
in increasing or decreasing order.
p.7 l.26: "absorbtion" -> "absorption" (Ankur Jain - 4/5/05)
p.7 l.30: "absorbtion" -> "absorption" (Ankur Jain - 4/5/05)
p.17 l.5: "Suppose have" -> "Suppose we have" (Ankur Jain - 4/5/05)
TOC p. v, l.14: "contradiction,implication" -> "contradiction, implication" (Ankur Jain - 4/5/05)
p.11 l.22: "38659886477" -> "3865988647" (same error occurred earlier on this page as noticed by Steve Butler) (Ankur Jain - 4/5/05)
p.17 l.29: "complement, reduces" -> "complement reduces" (Ankur Jain - 4/5/05)
p.28 l. 32: "Recall the some of the" should be either "Recall some of the" or "Recall the"
(Steve Butler - 4/6/2005)
p.33 l.3: "The converse is, if ..." should be "The converse is "If ..." (i.e., need to add starting quotes and capitilize the 'i') (Steve Butler - 4/6/2005)
p.46, problem 2.6: "An number in" -> "A number in" (Steve Butler - 4/6/2005)
p.5 l.9: "the f = 1" -> "f=1" (Ankur Jain - 4/10/05)
p.84 l.17: "method, that" -> "method that" (Ankur Jain - 4/10/05)
p.86 l.18: "set of number" -> "set of numbers" (Ankur Jain - 4/10/05)
p.87 l.25: "By definition the definition of lex" -> "By the definition of lex" (Ankur Jain - 4/10/05)
p.90 l.13: "is describe" -> "is to describe" (Ankur Jain - 4/10/05)
p.90 l.24: "A, denoted x-sub-a is" -> "A, denoted x-sub-a, is" (Ankur Jain - 4/10/05)
p.91 l.22: "of A because" -> "of A, because" (Ankur Jain - 4/10/05)
p.91 l.30: "in the Section 2" -> "in Section 2" (Ankur Jain - 4/10/05)
p.44 l.26: "women" -> woman" (Ron Graham 4/10/05)
p.53 l.22: "suppose that if m and n" -> "suppose that m and n"
p.54 l.5: the sum should go from 0 to k, NOT 1 to k
p.54, l.19: "38314/2=14157" -> "28314/2=14157"
p.54, footnote: "that 1 is also can" -> "that 1 also can"
p.55, l.15, 16: 1573 is not prime so this is not an example of a prime factorization
p.59, l.1: "reside class" -> "residue class"
p.59, l.5: "x and y" -> "x and x'"
p.71, l.29: "b=-13" -> "b=-23"
p.72, l.9: "the number of number" -> "the number of numbers"
[the last six were found by Steve Butler on 4/13/05]
p.118, line 12: "as it typical" -> "as it is typical"
p.120, line 22: "the longest decreasing subsequence in our example is 2,1" -> "the longest decreasing subsequence in our example is 7,5,2,1". A better fix is to replace the sequence on line 16 by "7,5,2,6,8,1,9" -> "2,6,8,1,9,5,7"
p.121, line 21: "just throw some" -> "just throw out some"
p.121, line 24: "such cases, can" -> "such cases it can"
p.l25, line 11: "in two types" -> "in the two types"
p.139, line 5: "usual way be" -> "usual way but"
p.139, line 7: "A(1,2)" -> "A(2,j)" and "A(1,n)" -> "A(n,j)"
p.144, question 2.17: "x3{0,1}. To" -> "x3{0,1}? To"
[These last six are due to Steve Butler on 4/14/05]
p.150, l. 29: "for for" -> "for"
p.154, l. 11: "n^{n+1}" -> "n^{k+1}"
p.159, l. 26: the "Delta" should be the capital Greek letter and not be spelled out
p.160, l. 9: "{0,1,2,...} A" -> "{0,1,2,...}. A"
p.162, l. 37: "The reason is that we need" -> "The reason that we need"
p.163, l. 25: "infinite sequence is a_n" -> "infinite sequence a_n"
p.174, l. 7: "(1/x^r))" -> "(1/x^r)"
p.174, l. 19: "dx<1/ln(2)" -> "dx=1/ln(2)"
p.177, l. 17: "taking 2" -> "taking 22" and "32 from" -> "3 from"
[The last 9 were found by Steve Butler on 4/17/2005]
p.23, problem 2: extra "(" before the p (Agatha Man - 4/18/2005)
p.23, problem 2, part (b): extra ")" after the q (Agatha Man - 4/18/2005)
p.28, l.8: "allow" -> "allows" (York Hong - 4/17/2005)
p.29, l. -8: "manipulation" -> "manipulations" (York Hong - 4/17/2005)
p.23, Question 1: Should be a question mark at the end.
p.24, Question 9: Missing ")" in the 4th line of the question.
p.38, l.11: insert "and" between "statements" and "not"
p.39, l.3: "true of false" -> "true or false"
p.39, l.9: Missing period at the end of the line
p.41, l.2: Missing period at the end of the line
p.41, l.6: Missing period at the end of the line
p.43, l. -1: "10^160, in other words" -> "10^160. In other words"
p.44, l.32: remove "asking question"
p.45, l.20: "the" -> "they"
p.47, Question 2.16: Need question mark at the end of statement.
p.51, l.5: Missing period at the end of the line.
[The last 11 were due to Ankur Jain on 4/19/2005).
p.73, l.21: "its" -> "it's" (Michael Kelly 4/23/2005)
p.23, l.-1: "true of false" -> "true or false" (Gracie Elqura 4/17/05)
p.53, l.26: "m = 2k+1" -> "n = 2k+1"
p.56, l.18: Missing period at end of line.
p.57, l.7: ", both" -> ". Both"
p.58, l.23: Missing period at the end.
p.58, l.-3: "integer For" -> "integer. For"
p.61, l.-5: Replace the period at the end of the line with a comma
p.62, Question 1.1 (a): "y even" -> "y is even"
p.62, Question 1.1 (b): "y even" -> "y is even"
p.63, Question 1.13 (b): Missing period at the end.
[The last 9 were due to Ankur Jain on 4/19/2005]
p.190, l-1: Missing ")" at the end of the line (Omar Zurita - 4/19/2005)
p. 57, l. 26: "a-sub-18 - 4/1" -> "a-sub-18 = - 4/1" (missing "=")
p. 57, l. 26: the list should begin "a-sub-16", not "a-sub-15", which
already exists in the last line. The subscripts should be 16-19, not 15-18
p. 57, l. 26: need period at the end of list, not comma
p. 61, l. 19: need period at the end of list, not comma
p. 67, l. 3: "competitor is" -> "competitor, is"
p. 67, l. 19: "him key" -> "him the key"
p. 71, l. 34: either the comma after "numbers" should be removed or a comma
after "and 11" should be inserted
p. 76, Question 4: "gcd(m.n)" -> "gcd(m,n)"
p. 77, Question 5: "gcd(m.n)" -> "gcd(m,n)"
p. 77, Question 6: "gcd(m.n)" -> "gcd(m,n)"
p. 78, Question 3, part (d) : missing period at the end
[The last 11 are due to Ankur Jain on 4/20/2005]
p.199, NT-2.1 (b): The answer given is for gcd(3510,672). The question asked
for gcd(3510,652). The correct sequence is 3510 > 652 > 250 > 152 > 98 > 54 > 44 > 10 > 4 > 2 > 0
and so the gcd is 2 (and the divisors are 1 and 2). (Lawrence Cayton - 4/27/2005)
p.80, l.6: extra comma at the end of the line (Charles Sanglimsuwan - 5/5/2005)
p.101, theorem 4: remove "be a finite set" from the end of the first sentence of the theorem. (Lawrence Cayton 5/10/2005)
p.211 l.10: "one-to-on" -> "one-to-one" (Charles Sanglimsuwan - 5/9/2005)
p.99 l.-12: "It's" -> "Its" (Michael Kelly - 5/11/2005)
p.99 l. 26: A comma is needed after "(Data Encryption Standard)", (Michael Kelly - 5/11/2005)
p.134 l.12: "You can think {BLANK}" -> "You can think of {BLANK}" (Lawrence Cayton - 5/23/2005)
p.92 1.1.(c): Question mark missing at the end of the statement (Dafna Bitton - 5/16/2005)
p.199 NT-2.2 l.3: {1,2,2} -> {1,2,2^2} (closing bracket is superscripted and should be replace
by a 2.
p.89, l.-9: "from and n-set" -> "from an n-set"
p.93, Problem 1.9(a): missing period at the end.
p.93, l.11 Extra space at the beginning (misaligned with the other lines)
(The last four items were found by Ankur Jain on 5/17/2005)
p.104, Theorem 4: First sentence has some repeated parts (Abhijit Das - 5/17/2005)
p.187 l.13: "a gate the computes" -> "a gate that computes"
p.187 l.-5: "67_10=01000111_2" -> "67_10=01000011_2"
p.188 l.-9: "Is there a short-cut way to compute it." -> "Is there a short-cut way to compute it?"
p.191 l.21: "is less than 250K of RAM." -> "is less than 250K of RAM?"
p.191 l.25: "as the why" -> "as to why"
p.193 l.-1: Need to insert a left parenthesis after the first `and'.
p.194 l.5,6: "D P(x)" -> "D, P(x)"
p.194 l.13: The second "D, P(x)" should be "D, Q(x)".
p.194 l.14: "the for all" -> "then for all"
p.196 l.-18: "(x-y)/2=n^{-1/2}" -> "(x-y)/2=n^{1/2}"
p.197 l.-3: "(33)" -> "(32)"
p.198 l.-19: "n=1" -> "n2=1"
p.198 l.-11: "(mod!d)" -> "(mod d)"
p.198 l.-5: The "log" should not be italicized.
p.198 l.-2: "( c)" -> "(c)"
p.199 l.4: (techinical) $\rfloor 0.9 \rfloor$ -> $\lfoor 0.9 \rfloor$
p.200 l.-2: "in Euclidan 13" -> "in Example 13"
p.207 l.14: The "(b)" needs to be moved in.
p.208 l.16: "|P(C)" -> "|P(C)|"
p.208 l.-11: The statement given is false. Namely, "|A|.|B|>|A|+|B|" as long as both are at least two and one is strictly greater than two. So for instance if |A|=1 then P(AxB) has FEWER elements than P(A)xP(B) for any set B.
p.211 l.3: "Sinc each" -> "Since each"
p.212 l.10,11: "The standard form in (1,5,4,3,2). Its the one-line form is (5,1,2,3,4)." -> "The standard form is (1,5,4,3,2). Its one-line form is (5,1,2,3,4)."
p.212 l.13: "and f(a_1)" -> "and f(a_3)"
p.213 l.20: "There no onto functions" -> "There are no onto functions"
p.215 l.-1: The solution is incorrect. We can have a set with 16 elements satisfying the condition, namely take all the primes and the number 1. Therefore the correct answer is 17.
p.217 l.-16: "2^0x5, 2^3x1,"-> "2^0x5, 2^1x3, 2^0x7, 2^3x1,"
p.219 l.13: "It is never satisfies" -> "It never satisfies"
p.219 l.-15: (technical) This line has an em-dash immediately followed by a hyphen. The hyphen should be removed.
p.223 l.10: " /n" -> "1/n"
p.224 l.-3: "by algebra" -> "by algebra."
p.225 l.-8: "n3-10n+9" -> "n3-10n+9."
p.226 l.2: "xy^{n-1}+y^n" -> "xy^{n-2}+y^{n-1}"
p.227 l.10: " "3|f_n " -> " "3|f_n" "
p.227 l.-6: "(f(n+1)-f(n))(g(n+1)-g(n))" -> "(f(n+1)-f(n))+(g(n+1)-g(n))"
p.227 l.-5: "(Delta f)(n))" -> "(Delta f)(n)"
(The last couple were found by Steve Butler on 6/4/2005)
p. 187. The solution to BF 2.7 should be P AND (~Q OR R).
(The last item found by Steven Kane on 9/29/05)
p. 190. The solution to LO 1.15 should be "If Dennis is not sure of victory,
then he won't enter the America's Cup". (found by Doug Turnbull on 9/3/2005)
p. 194 The solution for LO 2.19 part (b) says "the first statement is true and the second is false". It's actually
the other way around. (found by Jan Voung on 10/8/2005)
p. 197 The solution for NT 1.11 is "yes" only if a != c. (found by
Jan Voung on 10/8/2005).
p.189 l.7: "which is equivalent" -> "which are equivalent"
p. 197 l .-1: "3^8 -> 3^9"
p. 201 The final answer is 51, not 38. 2^37 = 2 x (-12) = 51
(last two items found by David Little on 10/11/2005)
p. 47 l.-1: "n even": n should be italicized
p. 48 l.1: "n odd": n should be italicized
(found by Neil Rhodes on 10/11/2005)
p.170 l.-5: 1/2 <= b_k" -> "1/2 < b_k" (found by Neil Rhodes on 11/1/2005)
The solution for IS 2.1 should include (b) under the list of bounded
sequences (found by Jan Voung 11/13/2005)
p. 228 l-12: "Only (f) is bounded" -> "(b) and (f) are bounded" (found by Zack Mangels 11/17/2005)
p.97 l.-7: "The domain might be" -> "The domain might by"
p.74 l.-2: "Likewise for T" -> "Likewise for t"
p.65 l.5 "{n-r}/k)" -> "{n-r}/k"
(last 3 found by Nikola Kantar 12/6/2005)