Talk:Gauss–Legendre algorithm

In base-2?

I can't understand how that doubling of correct digits works in base-2 (or how this algorithm works). Does the number of them grow faster, or is the "initial value" larger? --82.141.93.182 15:31, 3 November 2007 (UTC)[reply]

This was just one of those questions made too soon. No need to answer. --82.141.93.182 09:52, 4 November 2007 (UTC)[reply]

Why is there Pn? Pn=2^n... —Preceding unsigned comment added by 195.6.234.195 (talk) 13:23, 28 February 2008 (UTC)[reply]

The algorithme only uses O(1) memory

The algorithme itself only uses O(1) memory (i.e. constant), but the description says that it is memory hungry. While it is true that you need a very large memory to store the digits, that has nothing to do with the memory requirements of the algoritm itself.