Euler's remarkable '-producing polynomial and quadratic UFDs Example of

Makayla Stevens

Makayla Stevens

Answered question

2022-04-04

Euler's remarkable '-producing polynomial and quadratic UFDs
Example of a polynomial which produces a finite number of 's is:
x2+x+41
which produces 's for every integer 0x39.

Answer & Explanation

Jonathon Hanson

Jonathon Hanson

Beginner2022-04-05Added 9 answers

THEOREM.
The polynomial f(x)=(xα)(xα)=x2+x+k assumes only ' values for 0xk2Z[α] is a PID.
HINT.
Show all 's rm pn,;n=1-4k satisfy rm np=-1 so no 's split/ramify.
For proofs, see e.g. Cohn, Advanced Number Theory, pp. 155-156, or Ribenboim, My numbers, my friends, 5.7 p.108. Note: both proofs employ the bound rm p<n without explicitly mentiioning that this is a consequence of the Minkowski bound - presumably assuming that is obvious to the reader based upon earlier results. Thus you'll need to read the prior sections on the Minkowski bound. Compare Stewart and Tall, Algebraic number theory and FLT, 3ed, Theorem 10.4 p.176 where the use of the Minkowski bound is mentioned explicitly.
Alternatively see the self-contained paper [1] which proceeds a bit more simply, employing Dirichlet approximation to obtain a generalization of the Euclidean algorithm (the Dedekind-Rabinowitsch-Hasse criterion for a PID). If memory serves correct, this is close to the approach originally employed by Rabinowitsch when he first published this theorem in 1913.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?