Talk:Chudnovsky algorithm

Mathematics Stub‑class Low‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Stub	This article has been rated as Stub-class on Wikipedia's content assessment scale.
Low	This article has been rated as Low-priority on the project's priority scale.

The materials which I saw in this footnote are first wrong and also stolen from another web site.

How can the reader use this algorithm - from what point he can certainly know the n-th digit after the decimal dot is correct? 79.179.42.44 (talk) 21:16, 16 February 2012 (UTC)[reply]

[[Category:{{Translated|pt]]

Convergence unclear?

I assume I've missed something, but the series does not appear to converge. The ratio of successive terms starts very small, but then rises, approaching (6⁶×545140134)/(3³×640320³)×k ≈ 0.0000035×k for large k. I think that with the full expression (rather than the limit), the kth term exceeds the (k-1)th from k = 278703.

The formula as given seems to work OK (I've coded and tested against another method for 2000 d.p.), but even though, with small-ish precision at which the terms in the series appear to have vanished, there are later large then infinite terms being ignored. So it shouldn't work. Where have I misunderstood? Wyresider (talk) 14:27, 1 March 2015 (UTC)[reply]