Solution is not correct

[0xKarl98]

Under recursions / collatz_sequence.cairo , the answer is :

Which it should be

and in terms of the test ,

it didn't stop the computation when n reaches to 1 , so the correct version should be

[Codiumdium]

Hello ! Your code does not return the nth number of collatz from the seed. This is the purpose of this exercise. (step == nth)

(You can use ``` some code ``` for your code).

[0xKarl98]

Ah.. yeah what i'm trying to do is that this exercise didn't include the situation where the seed would be 0 , which is not satisfiable for us .
And also in terms of the step interation , i think it shoud be step = step + 1 , instead of step = step -1