Can someone help me with this python3 problem?

Question

If the number n is even divide it by two (n/2),
if it is odd multiply it by 3 and add 1 (3n+1).
Repeat this process until you get the number 1.

Find 10 starting numbers that takes at least 100 iterations to get 1

Answer 1

I got the solution so I will give some hints ,

Run a for loop with range less than 1000,

inside run a (while number>1) loop for each number in that range .

now check if the number is divisible by 2 ,if yes divide it like n=n/2 , otherwise n=3n+1.

In the while loop maintain a counter variable that will check how many times it ran until number became 1.

and you can for each number set the counter to 0 before while loop and then check after while loop if counter is greater than 100 ,if yes append the original number to say a numbers_array till you get 10 numbers with 100 iteration count.

Answer 2

Alumina by performing operations on another variable like num , num=x

also you can add a check like this to break the loop after array length is 10.

if len(numbers_array)>=10:
break
elif y >100:
numbers_array.append(x)

Answer 3

https://code.sololearn.com/c5iG05Ww4JMY/?ref=app

Answer 4

Thank you so much i have been trying to solve this for days

Answer 5

No problem :)

Answer 6

How can i append the original number now

https://code.sololearn.com/c8A11A20a2a1