Revision as of 07:09, 15 November 2021 edit Citation bot (talk \| contribs) Bots 5,867,154 edits Alter: pages. Add: jstor. Removed parameters. Formatted dashes. \| Use this bot. Report bugs. \| Suggested by Abductive \| #UCB_toolbar ← Previous edit		Revision as of 23:59, 8 January 2022 edit undo A1E6 (talk \| contribs) Extended confirmed users 2,398 edits m →Elementary proof with integral calculus Next edit →
Line 110: === Elementary proof with integral calculus === The Gauss-Legendre algorithm can be proven ~~without~~using ~~elliptic~~only ~~modular~~integral ~~functions~~calculus. This is done here<ref>{{citation\|title=Recent Calculations of π: The Gauss-Salamin Algorithm\|last1=Lord\|first1=Nick\|doi=10.2307/3619132\|year=1992\|journal=The Mathematical Gazette\|volume=76\|issue=476\|pages=231–242\|jstor=3619132}}</ref> and here<ref>{{citation\|title=Easy Proof of Three Recursive π-Algorithms\|last1=Milla\|first1=Lorenz\|arxiv=1907.04110\|year=2019}}</ref> ~~using only integral calculus.~~ == See also ==

Gauss–Legendre algorithm: Difference between revisions