1
$\begingroup$

Suppose I have $x^{(c(p-1))} \equiv y^{(p-1)} \pmod{p}.$ I would like to take the (p-1) root of both sides to get: $x^c \equiv y \pmod{p}$

I really just want to know if this a valid technique and what it would take to make it rigorous (I already know to show that $x,y$ are not congruent to 0)?

  • 0
    @quanta: I think it should be $2^{4\cdot4}$.2011-05-10

2 Answers 2

4

This is not true. If $p$ is a prime, both sides of the identity are $1$ (mod $p$), and hence equal, independent of the values of $x$, $y$ and $c$ (as long as $x$ and $y$ are not $0$ (mod $p$)).

1

Modulo $\rm\:p\:,\ \ x\not\equiv 0\ \Rightarrow\ x^{p-1}\equiv 1\:.\:$ Thus the map $\rm\:x\to x^{p-1}\:$ is not one-one so not invertible. But we do have $\rm\:x^p\equiv x\:,\:$ therefore $\rm\:x^p \equiv y^p\ \iff\ x\equiv y\:.\:$ Perhaps this is what you intended?

  • 0
    @Jor That's the OP's hypothesis (see the question title).2011-05-10