3

I wonder if there is a way to factor a number in $\mathbb{Z[\omega]}$ more "general"?, I currently use $(a+b\omega)(a+b\omega^2) = a^2 - ab + b^2 = \frac{(2a-b)^2 + 3b^2}{4}$ to find for example:

$13=(3+4\omega)(3+4{\omega}^2)$

but I have some issues with other numbers like $19$.

Fermatto
  • 129
  • 5
  • Have you constructed a list of all small prime numbers? If you have a way to sort these numbers, perhaps by norm, you can use Eratosthenes's sieve on the sorted list to (1) find the primes and (2) find the factors of any number on the list. Of course, $19$ is a prime integer, so the norm of its divisors in a number field are severely limited. – Eric Towers Oct 22 '21 at 05:46
  • 1
    For prime $p > 2$, $\mathbf Z[\sqrt{-3}]/(p) \cong \mathbf Z[\omega]/(p)$ since $\mathbf F_p[t]/(t^2+3) \cong \mathbf F_p[u]/(u^2+u+1)$. So if you want to know whether $p$ is prime of composite in $\mathbf Z[\omega]$ then it's the same as knowing if $-3 \bmod p$ is not a square or is a square in $\mathbf F_p$, which corresponds to$ p \equiv 2 \bmod 3$ or $p \equiv 1 \bmod 3$, respectively. That tells you the way $p$ factors but not an explicit decomposition if $p$ is reducible in $\mathbf Z[\omega]$. – KCd Oct 22 '21 at 05:51
  • It is maybe useful to recall to newcomers that $\omega:=e^{2i \pi/3}$. 2) Your question could be formulated as the search for an efficient algorithm for factorization by hand (and pencil...) ; unless you consider using a computer which would be quite normal...
  • – Jean Marie Oct 22 '21 at 05:59
  • https://resources.wolframcloud.com/FunctionRepository/resources/EisensteinFactorInteger/ – Jean Marie Oct 22 '21 at 07:10