Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Headache about Kollatz algorythm

  1. Feb 6, 2005 #1
    who can prove that if we have x=((3^n)*m-1)/(2^k) where x and m are odd
    then x will be: x=(2^(n-1))*m1-1 where m1 is odd? is it possible to prove it?
  2. jcsd
  3. Feb 8, 2005 #2
    http://nrich.maths.org/discus/messages/27/21992.html?1105738023 [Broken]

    -- AI
    Last edited by a moderator: May 1, 2017
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Similar Discussions: Headache about Kollatz algorythm
  1. About field (Replies: 1)