-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcollatzconjecture.py
More file actions
34 lines (31 loc) · 1 KB
/
collatzconjecture.py
File metadata and controls
34 lines (31 loc) · 1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
# https://en.wikipedia.org/wiki/Collatz_conjecture
# Even number: / 2
# Odd number: * 3 + 1
samples = 100000
leaderboard = []
for startingnumber in range(1, samples):
# measure how many steps to end up in the 4, 2, 1 loop
step = 0
highestnumber = startingnumber
number = startingnumber
while True:
step += 1
if number % 2 == 0:
number = number // 2
elif number % 2 == 1:
number = number * 3 + 1
if number > highestnumber:
highestnumber = number
# print(number)
if number == 1:
# print(f"{startingnumber} arrived at loop at step {step} with highest number being {highestnumber}")
leaderboard.append([startingnumber, step, highestnumber])
break
print("Leaderboard:")
print("Starting number, achieved step, highest number")
leaderboard.sort(key=lambda x: x[2], reverse=True)
leaderboardlength = len(leaderboard)
if 10 < leaderboardlength:
leaderboardlength = 10
for i in range(leaderboardlength):
print(leaderboard[i])