Evangelos Georgiadis
Registered: Oct 2003
Posts: 17 
.... and more errors .....
I would like to thank Professor Jeffrey Shallit for being the first person to point out the the following errata :
Page 913, Line 5
Current Claim: Newton's Method for Sqrt[n] produces t^2 correct digits after t iterations.
Correction: Since the number of digits approx. doubles at each step, clearly one should replace t^2 by 2^t.

Page 142 :
Current Claim: "a nested digit sequence ... never corresponds to a number that can be obtained by the mathematical operation of taking the roots."
On page 913, line 30, it is claimed that "The fact that nested digit sequences do not correspond to algebraic numbers follow from work by Alfred van der Poorten and others in the early 1980s."
Correction: The truth of the first statement is not yet known, and the second is incorrect. As pointed out on a previous post.

Page 1146, line 2 :
Current Claim: " ... finding an Euler circuit that visits once every node is in P."
Correction: The Definition of an Euler Circuit is that it visits every edge once, not every node.

Page 870 :
Current Claim: "The fact that the odd binomial coefficients form a nested geometrical pattern had apparently not been widely noticed before I emphasized it in 1982."
Correction: In 1966 on page 130 in a column of the Scientific American, Martin Gardner pointed the aforementioned out ...

I hope this helps.
evangelos
Report this post to a moderator  IP: Logged
