Re: collatz proof algorithm reveals e

I wrote:
>Seriously? The problem must be with your computer.
>Nobody else is complaining!

Sorry about that remark. Your computer is fine. I mailed Google to ask
what's the problem;
I'll let you know.

OK, the algorithm. It's indeed best explained in plain English.

I call the length of a collatz-trajectory for a number n the
prooflength of n.
Summation of all prooflengths for the numbers 1..n will give you a
number in
which many proofsteps are counted more than once (e .g. the trajectory
for 8 will
after 1 step be exactly the same as the trajectory for 4).
The algorithm associates with each n a reduced prooflength z(n) wich is
equal
to the number of times the collatz function must be applied before
entering a
known proof sequence, and summates the z(n).
So, for n = 10000 the program computes the sum of the reduced
prooflengths
for 1 to 10000 giving 27339.

mensanator wrote:
>Those plots are not e.
Of course not. But I conjectured they will be for n growing to
infinitity. There is no proof.

.

Loading