two problems about RSA

1. Given e, d and N, can you find p and q?
2. if alice send the same message M to three different people, that is, if you have M^e1, M^e2 and M^e3, and N1, N2, N3, can you recover M?

problem 1 involves deep number theory.

problem 2 can be solved using chinese remainder's theorem, assuming N1, N2 and N3 are relatively prime.