tag:blogger.com,1999:blog-32666420.post3897917210135949412..comments2013-01-29T23:31:10.387-08:00Comments on bitRAKE Studio: Collatz ConjecturebitRAKEhttp://www.blogger.com/profile/04427404471392714616noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-32666420.post-68765336582864307812008-05-08T17:58:00.000-07:002008-05-08T17:58:00.000-07:00This comment has been removed by a blog administrator.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-32666420.post-19403424738488221382007-12-15T18:49:00.000-08:002007-12-15T18:49:00.000-08:00Every number (A) can be represented as: A = k * 2^...Every number (A) can be represented as: A = k * 2^m + 2^n, m > n >= 0 and k odd or zero.<BR/><BR/>A <- 3A + 2^n, as per the algorithm<BR/><BR/>We have to look at three cases:<BR/><BR/>1) m-n = 1<BR/>2) m-n = 2<BR/>3) m-n > 2<BR/><BR/>...and show a reduction in (k).<BR/><BR/>3) case three progresses to:<BR/><BR/>3^(m-n) * k * 2^m + 2^m<BR/><BR/>where (k) begins to get reduced - the other two cases are more direct.bitRAKEhttps://www.blogger.com/profile/04427404471392714616noreply@blogger.com