On Wed, 24 Oct 2012, Herman Rubin wrote:Only if g is surjective.
> On 2012-10-24, William Elliot <ma...@panix.com> wrote:
> > On Tue, 23 Oct 2012, PT wrote:
> >> g(n) is a function of any integer n, positive or negative, which
> >> a) g(g(n)) = n
> > Let f(n) = 1 - n.
> > ff(n) = f(1 - n) = 1 - (1 - n) = n
> >> 1. Determine g(n)
> >> 2. Prove your solution is unique.
> From (a), g(g(g(n))) = g(n), so g is 1-1.
> Then from (b), g(n+2) = g(n) - 2.Ok, provided g is surjective, you've determined g(n) for all n >= 0.
> From (a) and (c), g(1) = 0. so we have g(0) and g(1), and increasing
What about g(n) for n < 0?
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.