1 // Basic Part about the 3n+1 conjecture

     1 // Basic Part about the 3n+1 conjecture

     2 //======================================

     2 //======================================

     3 

     3 

     4 

     5 

     5 //(1) Complete the collatz function below. It should

     6 //(1) Complete the collatz function below. It should

     6 //    recursively calculate the number of steps needed 

     7 //    recursively calculate the number of steps needed 

     7 //    until the collatz series reaches the number 1.

     8 //    until the collatz series reaches the number 1.

     8 //    If needed, you can use an auxiliary function that

     9 //    If needed, you can use an auxiliary function that

    21 //    the maximum number of steps and the second is the 

    22 //    the maximum number of steps and the second is the 

    22 //    corresponding number.

    23 //    corresponding number.

    23 

    24 

    24 //def collatz_max(bnd: Long) : (Long, Long) = ...

    25 //def collatz_max(bnd: Long) : (Long, Long) = ...

    25 

    26 

    26 

    28