The Math Forum

Search All of the Math Forum:

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

Math Forum » Discussions » sci.math.* » sci.math.research

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

Topic: Asymptotics of one function on natural numbers
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List

Posts: 1
Registered: 5/3/13
Asymptotics of one function on natural numbers
Posted: May 3, 2013 9:31 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Below, N is the set of natural numbers.

Consider a function s: N->N such that s(x) = x + 1. Now, if f: N->N is
an arbitrary function, define a mapping from the set of all such
functions to N as given below:

p(f) = c(1)

where c is the composition of functions s and f.

Finally, define a new function g: N->N such that

g(x) = f(x) for all x != f^n(x)
g(x) = p(f) otherwise.

We will use a shorthand notation g = F(f) for the function g defined above.

Consider now the sequence of F repeatedly applied: F, F(F(f)),..., F^k(f),...

Question: how one will study the asymptotics of F^k at k->infinity for
various n and p?


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.