We must prove that in the RSA cryptographic system for the primes and the encryption exponent in set is exactly elements that

you can use as the decryption exponent .

(That is for every , after encryption using encryption exponent , and then by using the decryption exponent we get back the ).

Thank you for all helpful answers.