Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import numpy
- import math
- import random
- def chk_cht(x):
- if x % 2 != 0:
- return x + 1
- return x
- def Step1(q, t):
- ksi = random.normalvariate(0, 1)
- N = (2 ** (t-1)) / (q) + (2 ** (t-1) * ksi) / q
- N = chk_cht(N)
- u = 0
- p = Step3(q, t, N, u)
- def Step3(q, t, N, u):
- p = (N + u) * q + 1
- if p > 2 ** t:
- p = Step1(q, t)
- else:
- p = Step5(q, t, N, u, p)
- def Step5(q, t, N, u, p):
- temp1 = 2 ** (N - 1)
- temp2 = 2 ** (N + u)
- if (temp1 == numpy.mod(1, N)) and (temp2 != numpy.mod(1, N)):
- return p
- else:
- u = u + 2
- p = Step3(q, t, N, u)
- t = 4
- q = 3
- p = 0
- u = 0
- print(Step1(q, t))
- RecursionError: maximum recursion depth exceeded in comparison
Add Comment
Please, Sign In to add comment