How can you use a primitive root to solve a modular congruence?

133 Views Asked by At

I've read through this answer to get some ideas: Solving a congruence using a primitive root

But my problem is slightly different and it's thrown me off in terms of understanding the logic.

I have $ x^5 \equiv 8\pmod{53}$ , I know 3 is a primitive root mod 53, how can I use this information to find a solution to this congruence?