home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!usc!sol.ctr.columbia.edu!usenet.ucs.indiana.edu!newshost.cs.rose-hulman.edu!news
- From: goddard@NeXTwork.Rose-Hulman.Edu (Bart Goddard)
- Subject: Re: run the hailstone backwards...
- Message-ID: <1992Jul23.190915.21531@cs.rose-hulman.edu>
- Sender: news@cs.rose-hulman.edu (The News Administrator)
- Nntp-Posting-Host: g214-1.nextwork.rose-hulman.edu
- Organization: Rose-Hulman Institute of Technology
- References: <1992Jul22.134601.6735@nmt.edu>
- Date: Thu, 23 Jul 1992 19:09:15 GMT
- Lines: 25
-
-
- In article <1992Jul22.134601.6735@nmt.edu> jefu@akbar.nmt.edu (Jeff
- Putnam) writes:
- >
- > I was thinking the other day about the hailstone numbers
- > (or whichever name you prefer to use) and thought about running
- > them backwards as a programming exercise. I wanted to
- > give the numbers n and m and produce the m smallest precursors
- > (a precursor to n is a number k, such that f(k), f(f(k)), and
- > (stuff deleted)
- > jefu <=> Jeff Putnam - New Mexico Tech <=> jefu@nmt.edu
- > "Overturn the dominant paradigm"
-
- David Klarner at the University of Nebraska-Lincoln Computer
- Science Dept. did some interesting work along these lines:
- Take some (affine) functions (in the case of this sequence a:n -> 2n,
- and b:n->(n-1)/3 are the functions: they're the inverses of the
- functions used in the statement of the problem) and apply them
- repeatedly to the integer 1. Think of a and b as generating a
- semigroup. Each way of composing these functions gives a word
- in the semigroup. Relations appear since the sets of precursors
- intersect. Klarner was able to show that certain sets of affine
- functions would "generate" the integers in this fashion.
-
- All I have are pre-preprints, so I can't give a good reference.
-