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:
|
def c(a):
num = 0
for k in range(0, len(a)):
num += a[k] * fibonacci(k+2)
return num
sage: c([1,0,1,0,1,0,1])
33
sage: c([0,1,0,1,0,1,0,1])
54
for i in range(1, 1000, 2): #nur ungerade Zahlen -> keine 0 am Ende
bits = []
num = bin(i)[2:]
while len(num) > 0:
bits.append(ord(num[0])-ord('0'))
num = num[1:]
while c(bits) < 73:
bits.insert(0, 0)
if c(bits) == 73: print bits
[0, 0, 0, 1, 0, 1, 1, 1]
[0, 0, 0, 1, 0, 1, 0, 0, 1]
[0, 1, 1, 0, 0, 1, 1, 1]
[0, 1, 1, 1, 1, 0, 1, 1]
[0, 1, 1, 0, 0, 1, 0, 0, 1]
[0, 1, 1, 1, 1, 0, 0, 0, 1] |