There is one thing that you haven’t discussed in detail in the lectures is the computation of the inverse of any given nonzero element alpha in an algebraic number field. In question 2 of Exercise Sheet 2, where the number field is isomorphic to I managed to work out that the inverse of the element , is by calculating in where the basis is But for the other one, I could not find it. In this field , which we can think of also as we know any element beta is some linear combination of the basis elements, for unique rationals The element uniquely corresponds to the element and to find the inverse of we need to find rationals such that the inverse which is also an element of is the linear combination I stopped there, but could not continue further.

The same kind of question is asked in question 3. Is there a general method for computing the inverse of a given element in algebraic number fields ?

—————————————

The general method uses Bezout’s lemma. Given two relatively prime polynomials and , there are polynomials and such that

Furthermore, and can be computed explicitly by using Euclid’s algorithm for polynomials. Once you know how to do this, you can take a non-zero class . Since is irreducible, and must be relatively prime. Then computing and as above will give the equation

in .

Try the problems out again from this point of view, and ask again if you get stuck. The ease of doing this kind of polynomial algebra is one of the main reasons that the ‘quotient of polynomial ring’ approach is often more useful than the ‘subfield of ‘ approach to algebraic number fields.