How does on solve for $x$ in
$x^k \equiv b \pmod n$
where $n$ is not prime and $\gcd(k,\phi(n)) > 1$
Can this be done using Euler's theorem and totient function?
How does on solve for $x$ in
$x^k \equiv b \pmod n$
where $n$ is not prime and $\gcd(k,\phi(n)) > 1$
Can this be done using Euler's theorem and totient function?