Fast evaluation of \(\zeta(3)\) (Q1310740): Difference between revisions

The author considers the problem of estimating the minimum number of elementary operations required in computing \(\zeta(3)\) within \(2^{-n}\). It is shown that \(O(n\log^ 3n\log\log n)\) such operations would be sufficient. The author starts with the identity \(\zeta(3)= s_ r+ R_ r\), where \(s_ r= (5/2)\sum^ r_{m=1} (-1)^{m-1}(m!)^ 2/m^ 3(2m)!\), and \(R_ r\) corresponds to the same sum with the summation extending from \(r+1\) to infinity. The proof is based on estimating the number of operations needed to compute \(s_ r\), as it easily follows that (with \(r=n\)) \(| R_ r|< 2^{-n}\).