How many (incongruent) solutions does the congruency above have among the Gaussian integers ?
Recall that if for some Gaussian integer .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let F = Z [ i ] / ( 8 + 3 i ) . We know from here that F has N ( 8 + 3 i ) = 8 2 + 3 2 = 7 3 elements. Now 73 is prime in Z , so that 8 + 3 i is prime in Z [ i ] and F is a field. The multiplicative group of a finite field is cyclic; let g be a generator.
Let's turn to the equation z 1 2 0 = 1 in F . We can write z = g m for 1 ≤ m ≤ 7 2 , with g 7 2 = 1 , and the equation takes the form g 1 2 0 m = 1 . The solutions m are of the form 7 2 ∣ 1 2 0 m or 3 ∣ 5 m or 3 ∣ m . Thus we have the 2 4 solutions m = 3 k for k = 1 . . . 2 4 .