I am trying to solve a problem involving modulo arithmetic but I am not sure what method to use as I have never done this style of question before nor do I have any examples to work from.
The question is:
Solve for $x$ where $x^5 = 11 \mod (35)$
So I though Eculid's GCD algorithm would help but I just get circular equations and get nowhere.
Thanks
Taking mod 10 on $x^5\equiv 11$ (mod 35)
the only possibilities of $x$ are:
$x\equiv 1$ or $6$
All $x$ in the range should be evaluated.
Using calculator $x\equiv 16$ (mod 35)