MHB Is $p\equiv 3\pmod{4}$ a condition for $\pi$ to be an even permutation?

MountEvariste
Messages
85
Reaction score
0
Let $p$ be an odd prime number such that $p\equiv 2\pmod{3}.$ Define a permutation $\pi$ of the residue classes modulo $p$ by $\pi(x)\equiv x^3\pmod{p}.$ Show that $\pi$ is an even permutation if and only if $p\equiv 3\pmod{4}.$
 
Mathematics news on Phys.org
There are more elementary variants, but this one is the shortest:

Since taking the third power fixes $0$, the sign of $\pi$ is determined by the sign of its action on the nonzero residues modulo $p$. As $\mathbb{F}_{p}^{\times}$ is a cyclic group of order $p − 1$, $\pi$ is the same as multiplication by $3$ on $\mathbb{Z}/(p − 1)$. This permutation is the same as the action of Frobenius element at $3$ acting on $\mu_3 = \left\{w_1, · · · , w_{p−1}\right\}$, the set roots of $f(x) = x^{p-1}-1$. Its action on the roots of this polynomial is even iff it acts trivially on the square root of the discriminant of this polynomial, which is

$$d:= \prod_{i < j} (w_i - w_j)$$

This, in turn, is true iff $3$ splits in the extension $\mathbb{Q}(d)$. It's not hard to see that

$$(-1)^{\binom{p-1}{2}}d^2 = \prod_{i,j=1}^{p-1}(w_i-w_j) = \prod_{i=1}^{p-1}f'(w_i) = -(p-1)^{p-1},$$

which is a square times $−1$.Therefore, if $p \equiv 3 \mod {4}$, then $\binom{p-1}{2}$ is odd, so adjoining the square root of the discriminant gives $\mathbb{Q}$, so $3$ splits tautologically, and the permutation is even. If $p \equiv 1 \mod{4}$, then the extension is $\mathbb{Q}(i)$, in which $3$ does not split, so the permutation is odd.
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Thread 'Unit Circle Double Angle Derivations'
Here I made a terrible mistake of assuming this to be an equilateral triangle and set 2sinx=1 => x=pi/6. Although this did derive the double angle formulas it also led into a terrible mess trying to find all the combinations of sides. I must have been tired and just assumed 6x=180 and 2sinx=1. By that time, I was so mindset that I nearly scolded a person for even saying 90-x. I wonder if this is a case of biased observation that seeks to dis credit me like Jesus of Nazareth since in reality...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Back
Top