home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!mcsun!corton!irisa!irisa.fr!saouter
- From: saouter@irisa.fr (Saouter Yannick)
- Newsgroups: sci.math
- Subject: Another Collatz sequence
- Message-ID: <1992Sep15.215038.5092@irisa.fr>
- Date: 15 Sep 92 21:50:38 GMT
- Sender: news@irisa.fr
- Organization: Irisa, Rennes(FR)
- Lines: 15
-
- I am currently trying to build some examples of Collatz sequence and so I was trying to
- compute the length of the cycle of the following sequence:
-
- g(n) = (2/3) n if n=0 (mod 3)
- (4/3) n - 1/3 if n=1 (mod 3)
- (4/3) n + 1/3 if n=2 (mod 3)
-
-
- as stated in Lagarias' paper. I have been able to compute length of cycles for
- 1,2,3,4,5,6,7 and 9. I know that the problem of knowing whether 8 leads to a cycle is
- still open. So it is impossible to compute length 8, 12, 18, ... . But what about 11, 13
- and so on ? Is it known whether they lead to cycles and in this case, is the length known ?
-
- Yannick Saouter - IRISA, Rennes, France.
- saouter@sigle.irisa.fr
-