1

Show that if $p \equiv 3$ mod $4$ is a prime in $\mathbb{Z}$, then $p$ is a prime in $\mathbb{Z}[i]$

I think I probably have to use something related to norm to solve this problem but I can't seem to figure out anything. Can someone suggest how I can solve this problem? Thanks

123
  • 201

2 Answers2

3

If $p=(a+bi)(c+di)$ then $$p^2=(a^2+b^2)(c^2+d^2)$$ Therefore $a^2+b^2$ is $1$, $p$ or $p^2$. If it is $1$ or $p^2$ it is easy to conclude that $p$ is a prime in $\Bbb Z[i]$. If it is $p$ we arrive at a contradiction taking mod $4$.

ajotatxe
  • 65,084
  • Hi, I don't quite understand your proof. I thought i am supposed to prove if p |ab then p|a or p |b in Z[i]. I can't see where there is shown. – 123 May 01 '15 at 01:25
  • @123 It's been 8 years, but that's the definition of a prime, not an irreducible. – iwjueph94rgytbhr Nov 09 '23 at 04:12
1

Hint: Use the fact that $\mathbf Z[\mathrm i]$ is a euclidean domain. Hence $p$ not being prime means it is reducible, say $$p=(a+b\mathrm i)(c+d\mathrm i)$$ Compute the norm of both sides and conclude that $p$ is the sum of two squares. Is that possible?

Bernard
  • 175,478