50 lines
1.4 KiB
Python
50 lines
1.4 KiB
Python
# # Problem 14:
|
|
#
|
|
# [Euler Project #14](https://projecteuler.net/problem=14)
|
|
#
|
|
#
|
|
#
|
|
# > The following iterative sequence is defined for the set of positive integers:
|
|
# >
|
|
# > n → n/2 (n is even)
|
|
# > n → 3n + 1 (n is odd)
|
|
# >
|
|
# > Using the rule above and starting with 13, we generate the following sequence:
|
|
# > 13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1
|
|
# >
|
|
# > It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it is thought that all starting numbers finish at 1.
|
|
# >
|
|
# > Which starting number, under one million, produces the longest chain?
|
|
# >
|
|
# > NOTE: Once the chain starts the terms are allowed to go above one million.
|
|
#
|
|
#
|
|
# ---
|
|
import os
|
|
|
|
def collatz_length(n: int):
|
|
count=0
|
|
while n != 1:
|
|
if n%2 == 0:
|
|
n=int(n/2)
|
|
count+=1
|
|
else:
|
|
n=int(3*n+1)
|
|
count+=1
|
|
return int(count+1)
|
|
|
|
# I can't think of a way to simplify the problem, so brute force then???
|
|
|
|
# initialize a dictionary for storage
|
|
solution_dict = {
|
|
'candidate': 1,
|
|
'length': 1
|
|
}
|
|
|
|
for i in range(1000000):
|
|
length=collatz_length(i+1)
|
|
if length > solution_dict['length']:
|
|
solution_dict['candidate']=i
|
|
solution_dict['length']=length
|
|
|
|
print("The longest sequence was ",solution_dict['length']," members long, with a starting number of ",solution_dict['candidate']) |