p is an odd prime, and p does not divide u prove that if p is congruent to 2 mod 3, then every unit is a cubic residue mod p. I don't know where to start with this.

Printable View

- Apr 6th 2013, 01:04 PMwingtipcubic residue
p is an odd prime, and p does not divide u prove that if p is congruent to 2 mod 3, then every unit is a cubic residue mod p. I don't know where to start with this.

- Apr 6th 2013, 03:14 PMHallsofIvyRe: cubic residue
Well, you might start with the definition of "cubic residue". What is that?

- Apr 6th 2013, 03:45 PMwingtipRe: cubic residue
u is a cubic residue mod p if there exists some b such that u is congruent to b^3 mod p

- Apr 6th 2013, 06:13 PMjohngRe: cubic residue
Hi,

If you know a few facts, this is easy. Otherwise, it might be kinda hard.

The multiplicative group of is cyclic with generator, say x (a primitive root mod p). Then the order of is the number of elements in the set . Now if 3 divides p - 1, then p is congruent to 1 mod p, but p is congruent to 2 mod 3. So gcd(p-1,3)=1. That is, the order of is p - 1 and so every non-zero element of is a cube; i.e. a cubic residue.