This problem was posed during a recently ended contest.
- I am given a value for n and e. e = 65537. n is a 2048-bit number.
- p is a 1024-bit prime number.
- q is the modular inverse of e mod p. That's the mistake made in this problem. q is also non-prime.
Can I use this knowledge to simplify my calculation of the totient function?