Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: brute force tetration / greedy tetration
Replies: 9   Last Post: Jan 27, 2009 6:30 PM

 Messages: [ Previous | Next ]
 matt271829-news@yahoo.co.uk Posts: 2,136 Registered: 1/25/05
Re: brute force tetration / greedy tetration
Posted: Jan 27, 2009 4:46 PM

On Jan 27, 5:48 pm, David C. Ullrich <dullr...@sprynet.com> wrote:
> On Tue, 27 Jan 2009 09:39:43 EST, amy666 <tommy1...@hotmail.com>
> wrote:
>
>
>
>
>

> >here i introduce a brute force / greedy algoritm to compute f(f(x)) = exp(x).
>
> >its works best outside the unit radius.
>
> >it is based upon the approximation below , and is trivial considering the approximation.
>
> >since , once we have a sequence of ever better getting approximations , taking that limit gives the desired result.
>
> >the approximations are also usefull because of computational boundaries.
>
> >the algoritm is the limit n -> oo
>
> >note that f(f(x)) = g(x) can be computed if g(0) = 0
>
> >f(f(x)) = exp(x) - exp( -1 * 25^n * x^2 )
>
> >examples :
>
> >n = 1 :
>
> >f(f(x)) = exp(x) - exp( -25 * x^2 )
>
> >n = 2 :
>
> >f(f(x)) = exp(x) - exp( - 625 * x^2 )
>
> >n = 3 :
>
> >f(f(x)) = exp(x) - exp( - 15625 * x^2 )
>
> >..
>
> >i , tommy1729 , am the first to invent this.
>
> Invent _what_?

Presumably it's a joke?

Date Subject Author
1/27/09 amy666
1/27/09 David C. Ullrich
1/27/09 quasi
1/27/09 quasi
1/27/09 hagman
1/27/09 quasi
1/27/09 Mariano
1/27/09 quasi
1/27/09 matt271829-news@yahoo.co.uk
1/27/09 Mariano