Talk:Siegel–Walfisz theorem
Latest comment: 1 year ago by 68.49.106.242 in topic Effective computability of C_N
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Effective computability of C_N edit
Hi, It is not true that C_N is not effectively computable. See, for example, Estermann's Modern Prime Number Theory in which he gets the constant 1/20 if I remember correctly. What is NOT effectively computable in his result is the implicit constant in the O-notation. There is also a discussion of this on pages 380-1 of my book with Montgomery.
Bob Vaughan 68.49.106.242 (talk) 19:50, 25 July 2022 (UTC)