0e8182e2   
   From: luke.earles@gmail.com   
      
   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!   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)