integers F
discriminant F
This is an implementation of the Zassenhaus' Round 2 algorithm, following the textbook A course in computational algebraic number theory by Henri Cohen (Algorithm 6.1.8). Given a number field $F=\mathbf Q(\theta)$ defined as a simple extension over the rational numbers by an integral primitive element $\theta$, it computes an integral basis of the algebraic integers, expressed as polynomials in $\theta$.
|
|
|
The discriminant is computed using the same algorithm.
|
|
The object integers is a method function.