Go Back > Extra Stuff > Blogorrhea > enzocreti

Thread Tools
Old 2020-07-02, 09:29   #1
Mar 2018

21216 Posts
Default collatz 3x+1

I found a forumula about the 3x+1 problem

let be T(k,n) the trajectory starting from integer n.

k is the number of iterations

T(0,n)=n i think

T(k,n)=n*lambda(k,n)+rho(k,n) how to proof that?

where lamba(k,n)=(3^(x(0,n)+...+x(k-1,n))/2^k

x(0,n) the parity vector of 1's and 0's, 1 if x(i,n) is odd and 0 if it is even

rho is a sum from i=0 to k-1 of


enzocreti is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Collatz 3x+1 problem Cybertronic Miscellaneous Math 4 2019-03-20 08:40
A new aproach to C.Collatz. 3n+1... JM Montolio A Miscellaneous Math 10 2018-02-28 20:06
this thread is for a Collatz conjecture again MattcAnderson MattcAnderson 16 2018-02-28 19:58
Collatz conjecture MattcAnderson MattcAnderson 4 2017-03-12 07:39
Related to Collatz conjecture nibble4bits Math 1 2007-08-04 07:09

All times are UTC. The time now is 06:42.

Sun Nov 28 06:42:13 UTC 2021 up 128 days, 1:11, 0 users, load averages: 0.76, 0.82, 0.89

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.