Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def T(n):
- return ((n*3**(n%2)+n%2) >> 1)
- def Tk(n,k):
- if k==1:
- return T(n)
- else:
- return Tk(T(n),k-1)
- def Xk(n,k):
- return Tk(n,k)%2
- def log2(n):
- i=0
- while 2**i < n:
- i += 1
- return i
- def Ek(n):
- e=[n%2]
- e.extend([Xk(n,k) for k in range(1,log2(n)-1)])
- return e
- def Eknum(n):
- e=Ek(n)
- return sum([e[i]*2**(len(e)-i-1) for i in range(len(e))])
- def b(n):
- return n >> (log2(n)-95)
- def alg1(n):
- ao=0
- while True:
- atmp = bin(b(n+ao)^Eknum(n+ao))[2:97]
- s=0
- for i in range(len(atmp)):
- p = 2**(len(atmp)-i-1)
- s = s + int(atmp[i])*p
- a=(s+ao)%2**128
- ao=a
- print(a)
- yield a
- x=2**95+1
- c=alg1(x)
- [c.__next__() for i in range(10)]
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement