Euclidean algorithm in imaginary abelian sextic number fields

DOI10.18311/JIMS/2024/29992MaRDI QIDQ6127553zbMATH OpenFDO

Authors Subramani Muthukrishnan, Usha Keshav Sangale

Publication date 14 April 2024

Full work available at URL https://doi.org/10.18311/JIMS/2024/29992

zbMATH Keywords

class numberEuclidean ringsnon-Wieferich primesnumber fieldsprimitive roots

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Algebraic numbers; rings of algebraic integers (11R04)

Recommendations

• Euclidean algorithm in Galois quartic fields
• Euclidean algorithm in small abelian fields
• The Euclidean algorithm for number fields and primitive roots
• Generalized Euclidean algorithms
• A computer algorithm for finding new Euclidean number fields

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Euclidean algorithm in imaginary abelian sextic number fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6127553)