0e8182e2   
   From: jbb@notatt.com   
      
   Luke Earles wrote on 9/26/2017 7:00 PM:   
   > If we have an odd number n, then we multiply it by 3 and add one (n*3+1), we   
   know we will get an Even number p. How can one determine how many times p can   
   be divided by two before it is odd again?   
   >   
   > Another way of asking the same question. if we have (n*3+1)/(2 to some   
   power), how can we determine if the number produced will be odd or even   
   depending on the chosen n and the chosen power of two?   
   >   
   > Is there a way to symbolize divide by two until odd in a function?   
   > Thanks for all the help!   
   >   
   You are fooling around with the Collatz problem (look it up). Be   
   careful. it has caused many ardent potential solvers to go blind. There   
   is a warning to that effect in the Bible or maybe it was in Erdos' "Book".   
   --   
   Jeff Barnett   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)