"You should compute P⋅Q−1 modulo 109+7, where Q−1 denotes the multiplicative inverse of Q modulo 109+7."↵↵So, I more (or less) understood what that means.↵I can express, say 1/5 by the number 400000003.↵I can calculate that number using https://www.geeksforgeeks...
Note: The authors of the original RSA paper carry out the key generation by choosingdand then computingeas the modular multiplicative inverse ofdmoduloφ(n). Since it is beneficial to use a small value fore(e.g., 65,537) in order to speed up the encryption function, curren...