Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!rutgers!ub.d.umn.edu!cs.umn.edu!martin
From: martin@cs.umn.edu (Johnny Martin)
Newsgroups: comp.theory
Subject: Re: 3n+1
Keywords: 3n+1, Ulam's problem
Message-ID: <1990Aug27.201035.23351@cs.umn.edu>
Date: 27 Aug 90 20:10:35 GMT
References: <511@sun13.scri.fsu.edu>
Organization: University of Minnesota, Minneapolis - CSCI Dept.
Lines: 23

<prob. description stuff deleted>
>
>The only published references I have found have just mentioned this
>as an unsolved problem and given few series of numbers.
>I haveqbeen unable to find anything in the literature about proof
>technigues which have been tried or any partial results, etc. 
>Has anything other than a sketch of the problem been published?
>Have any partial proofs (such as that there are no cycles other than
>1) been devised?

The following paper contains a reasonably good survey of the problem.

    Jeffrey C. Lagarias
    The 3x + 1 Problem and its Generalizations
    American Mathematical Monthly
    pp 3-23
    January 1985


-- 
Johnny Martin          (martin@umn-cs.cs.umn.edu)
Dept. Comp. Sci., 4-192 EE/CS, University of Minnesota, Minneapolis MN 55455
--