Talk:Borwein's algorithm
Appearance
Mathematics Start‑class Low‑priority | ||||||||||
|
Borweins'?
Should this be called Borweins' algorithm, as it belongs to two Borweins? Shreevatsa (talk) 23:25, 28 September 2008 (UTC)
- A quick google books search suggests that "Borwein's algorithm" is an established name for the algorithm. — Carl (CBM · talk) 00:01, 29 September 2008 (UTC)
- Ok then. I see only a handful of results either way (3 for Borwein's and 5 for Borweins', so actually more for the latter) but maybe you searched something else. Regular Google searches give 785 for Borwein's and 117 for Borweins', but it's hard to tell how many of them are authoritative. Anyway I am not myself familiar enough with the literature in this area, so I shouldn't really be talking :) Shreevatsa (talk) 01:01, 29 September 2008 (UTC)
Error?
I have just programmed the second algorithm (the one with Failed to parse (syntax error): {\displaystyle p_0 = \2+sqrt[]2} ) into my TI89 Titanium - and it converges to 3.38871193..., not pi. I could not find anything wrong with my program, so something must be wrong with the algorithm. Lucas Brown 42 (talk) 18:45, 27 February 2009 (UTC)
- I have just figured out and corrected the error: the article stated that
- .
- This should, and now does, read
- . —Preceding unsigned comment added by Lucas Brown 42 (talk • contribs) 20:19, 27 February 2009 (UTC)