Account Options

  1. Sign in
The old Google Groups will be going away soon, but your browser is incompatible with the new version.
Google Groups Home
« Groups Home
Message from discussion today's puzzle
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 
From:
To:
Cc:
Followup To:
Add Cc | Add Followup-to | Edit Subject
Subject:
Validation:
For verification purposes please type the characters you see in the picture below or the numbers you hear by clicking the accessibility icon. Listen and type the numbers you hear
 
William Elliot  
View profile  
 More options Oct 24 2012, 10:39 pm
Newsgroups: sci.math, rec.puzzles, alt.math.recreational
From: William Elliot <ma...@panix.com>
Date: Wed, 24 Oct 2012 19:39:32 -0700
Local: Wed, Oct 24 2012 10:39 pm
Subject: Re: today's puzzle

On Wed, 24 Oct 2012, Herman Rubin wrote:
> 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
> >> produces an integer value, with conditions:

> >> a) g(g(n)) = n
> >> b) g(g(n + 2) + 2) = n
> >> c) g(0) = 1

> > Let f(n) = 1 - n.

> > ff(n) = f(1 - n) = 1 - (1 - n) = n
> > f(f(n + 2) + 2) = f(1 - (n + 2) + 2) = f(1 - n) = n
> > f(0) = 1

> >> 1. Determine g(n)
> > g = f.

> >> 2. Prove your solution is unique.

> From (a), g(g(g(n))) = g(n), so g is 1-1.

Only if g is surjective.

> Then from (b), g(n+2) = g(n) - 2.

> From (a) and (c), g(1) = 0. so we have g(0) and g(1), and increasing
> n by 2 decreases g(n) by 2, so g is uniquely defined.

Ok, provided g is surjective, you've determined g(n) for all n >= 0.
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.