Skip to content

Recursive function to calculate the number of steps to get to 1

License

Notifications You must be signed in to change notification settings

willbenica/collatz

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Collatz Conjecture

$$ a_{n} = \begin{cases} \frac{1}{2} a_{n-1} &\text{for} \quad a_{n-1} \quad \text{even} \\ 3 a_{n-1} +1 &\text{for} \quad a_{n-1} \quad \text{odd} \end{cases} $$

For more information see Wolfram MathWorld

About

Recursive function to calculate the number of steps to get to 1

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published