Tags: rsa 

Rating:

tl;dr

A equality relating the primes to some unknown number is given, since these are rational numbers and both numerator and denominator are known, it is effectively 2 seperate equalities, allowing the primes to be solved for

e is 0x20002 here so a square root mod n is needed, which is easy with crt

Original writeup (https://github.com/Ariana1729/CTF-Writeups/blob/master/2019/CryptoCTF/Clever%20Girl/README.md).