Talk:Spigot algorithm

I forked this page from the Spigot article. Please contact me if you have anything that you feel like talking to me about. —Preceding unsigned comment added by Goofyheadedpunk (talk • contribs) 21:19, 2 Dec 2004 (UTC)

Others?
Right now, the article only lists the Bailey-Borwein-Plouffe formula as a spigot algorithm. Are there others? -- 128.104.112.85 (talk) 00:23, 16 April 2008 (UTC)


 * Yes - this MathWorld page gives a list of BBP-type formulae which can be used as the basis of spigot algorithms for various mathematical constants. The BBP π formula/algorithm is the best known example because it was so unexpected. Gandalf61 (talk) 11:23, 16 April 2008 (UTC)

Clarification needed
The page states that: "We add a few terms in the 'tail'" and the first few terms of the "'tail'". How many is "a few" in this context? Can one term be used if one wants to compute just one digit? I think there should be some sort of clarification, explaining the value of "a few" Earl of Warwick 11:02, 28 February 2012 (UTC) — Preceding unsigned comment added by AmbroseDudley (talk • contribs)

Bounding the error
Currently it is said "noting that the error introduced by truncating the sum is less than the final term" but I don't think this is evident so I suggest to add a short justification, or at least a mention to the need of an error bound if going into details is cumbersome. Davidsevilla | Talk 13:35, 7 February 2018 (UTC)