RSA Tinker

Project Euler 182

#from Primes_Under_1_000_000 import prime_list
#from random import randint
##from rsa_list import rsa
##
##from UNIQUE_VARIABLES import U_V


def gcd(x,y):
    while y!=0:
        (x,y)=(y,x%y)
    return(x)

def rsa_return(p,q):
    n=p*q
    y=(p-1)*(q-1)
    to_return=[]
    for e in range(2,y+1):
        if gcd(e,y)==1:
            to_return.append(e)
    return(to_return)


def count_check(p,q):
    n=p*q
    e_values = rsa_return(p,q)
    to_return=[]
    for i in range(len(e_values)):
        c=0
        for x in range(0,n):
            if (x**e_values[i])%n==x:
                c+=1
        to_return.append(c)
    return(to_return)

y = rsa_return(19,37)
x = count_check(19,37)

p=19
q=37

####
####POWER CODE
to_print=[]
for i in range(len(y)):
    #Formal thanks to crypto stack!
    to_print.append((1+gcd(y[i]-1,p-1))*(1+gcd(y[i]-1,q-1)))

if x==to_print:
    print(True)