stable algorithm with complexity O(n)

[David Cournapeau]

On Mon, Dec 15, 2008 at 2:12 PM, Aaron Brady <castironpi at gmail.com> wrote:

>
> I agree.  Most of his examples were tautologies.  The magnet one was
> the exception.

A proof is nothing more than a tautology :) The fact that pi is not
rational is not trivial (but certainly has been proved for some time
now).

cheers,

David