The big punchline of my class on quadratic imaginary number theory was that produces primes for small values of x if and only if the ring of integers in the corresponding number field has unique factorization. This is already an awesome result, but what makes it truely astounding is that the meaning of “small” is different in the two directions of the theorem. That is, for the case of c=41 say, the theorem goes is prime for implies that R has unique factorization which implies that is prime for .
The proof of this is surprisingly easy, once you know the material from my last post. First off, let’s fix some notation. Let z be a root of the polynomial , and let . Let’s prove that is prime for implies that R has unique factorization (where B is the Minkowski bound). We need only show that every rational prime smaller than B stays prime in R. That is, we need only show that the polynomial has no roots modulo p. Suppose it did have a root x, we can obviously assume that . So must be prime by assumption. However, it is a multiple of p, hence . But , which is a contradiction
Now let’s show that R having unique factorization implies that is prime for . Suppose that were composite for some x with . Then let p be the smallest prime factor of . From the bound, it is easy to see that p < 41. Since , we see that p is not prime in R. Hence, since R has unique factorization, p must factor in R. It is easy to see that this means p must be the norm of something in R. But, there’s nothing that has a nonsquare norm smaller than 41.
(Again, thanks to Jared Weinstein for explaining a bunch of this to me.)