[Math] Solve congruence with primitive root

Question

I am seeking the solution to the congruence

$$
29x^{33} \equiv 27\ \text{(mod 11)}
$$

Primitive root is 2 and $ord_{11} (2) =10$. Then I got

so the equation can be field:

$$
lnd_2(29) + 33 lnd_2(x) \equiv lnd2(27)\ \text{(mod 10)}
$$

Since $$lnd_a(rs) \equiv lnd_ar + lnd_as \ \text{(mod p-1)}$$

However, how to get a prime number 29 to be the product of two numbers??

Answer 1

Index tables are unneeded since it is $\rm\color{#c00}{easy}$ to take $\,n$'th roots when $\,n\,$ is coprime to $\,p\!-\!1,\,$ e.g.

${\rm mod}\ 11\!:\ 29x^{33}\!\equiv 27\overset{\large\, x^{10}\,\equiv\, 1}\iff\!-4x^3\!\equiv 16\!\!\iff\! x^3\!\equiv -4\!\!\!\overset{\rm\color{#c00}{cube}}\iff\!\! \dfrac{1}x\equiv 2\!\iff\! x \equiv \dfrac{1}2 \equiv \dfrac{12}2 = 6$