This is just a toy project i wrote for fun.
You can use this for studiyng RSA, but if you want proper RSA encryption in your project, use a cryptography library.
from math import gcd
def prime(x):
count = 0
for i in range(int(x/2)):
if x % (i+1) == 0: