Re: 3n+1 problem
 From: Madhu <enometh@xxxxxxxx>
 Date: Wed, 22 Apr 2009 08:24:04 +0530
* Raffael Cavallaro
Wrote on Tue, 21 Apr 2009 11:20:22 0700 (PDT):
 On Apr 21, 8:32 am, Espen Vestre <es...@xxxxxxxxxx> wrote:

> And btw. I think the whole competition is rather boring. It's much more
> fun to play with math stuff using bignums anyway, especially for
> problems like this one. For instance, the sequence length divided by the
> number of bits in the number appears to approach 7something for large
> numbers. Now if I only could find a theorem proving something like that
> ;)

 <http://en.wikipedia.org/wiki/Collatz_conjecture>

 i.e., unlikely, since it's unproven that the sequence even terminates
 for all inputs, but I suspect you already knew that...
I think Espen Vestre was implicitly implying that if the property he
discovered could be proved, then there would be a new way to solve the
open problem.
Even if Espen's property could be shown to true for sequences that
terminate, it would open up a new (possibly IT based) approach for
solving the open problem. (So far I've not seen this approach taken in
the tiny amount of literature I've seen)

Madhu
.
 References:
 3n+1 problem
 From: Cross
 Re: 3n+1 problem
 From: Harald HancheOlsen
 Re: 3n+1 problem
 From: Cross
 Re: 3n+1 problem
 From: namekuseijin
 Re: 3n+1 problem
 From: Raffael Cavallaro
 Re: 3n+1 problem
 From: espen
 Re: 3n+1 problem
 From: Thomas A. Russ
 Re: 3n+1 problem
 From: Espen Vestre
 Re: 3n+1 problem
 From: Espen Vestre
 Re: 3n+1 problem
 From: Raffael Cavallaro
 3n+1 problem
 Prev by Date: Re: PLOT: A nonparenthesized, infix Lisp!
 Next by Date: Re: 3n+1 problem
 Previous by thread: Re: 3n+1 problem
 Next by thread: Re: 3n+1 problem
 Index(es):
Relevant Pages
