i was looking at shor's algorithm and had a bright idea, square the numbers rather than multiply by a specific base.
this idea however doesn't seem to work.
for example, the followng code:
def gcd(p,q):
if p == 0:
return q
else:
return gcd(q%p,p)
N= 97*79
per = 1...