Jump to content

Talk:Gauss–Legendre algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SineBot (talk | contribs) at 13:25, 28 February 2008 (Signing comment by 195.6.234.195 - "In base-2?: "). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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]