I was attempting Wiener's Attack on RSA with a simple example and I came to a one variable modulo equation which I managed to solve with brute-force but I think it must be easier than that with some algorithm/formula.
here it is.
$e * d \equiv 1 \mod phi(N)$
e and phi(N) are known: e = 5 550 641 and phi(N) = 15 726 816
so it gives us: $5 550 641 * d \equiv 1 \mod phi(N)$
I got the answer, d = 17 but as I mentioned only with brute force, is there any formula or algorithm for solving this equation?