def rsa_public_key(p, q, e):
 n = (p * q)
 if (isprime(p) and isprime(q)):
  phi = totient(n)
  if (gcd(e, phi) == 1):
   return (n, e)
 return False

def rsa_public_key ( p , q , e ) : n = ( p * q ) if ( isprime ( p ) and isprime ( q ) ) : phi = totient ( n ) if ( gcd ( e , phi ) == 1 ) : return ( n , e ) return False
return the rsa *public key* pair .