A program to test the p-rationality of any number field
Résumé
We give very short PARI programs (see §§ 4.1, 4.2) to test if the number field K (defined by an irreducible polynomial) is p-rational for a given prime p≥2.
For the convenience of any user, the programs are written with ``verbatim'' characters, so that it is sufficient to ``copy and paste'' them from the pdf file to the ``Terminal Session--Math--gp'' of http://pari.math.u-bordeaux.fr/ or of ``Sage'' http://www.sagemath.org/fr/telecharger.html.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...