Euclidean number fields. I. II. III

DOI10.1007/BF03024378zbMath0433.12004OpenAlexW2916487254MaRDI QIDQ1139086

Hendrik W. jun. Lenstra

Publication date: 1979

Published in: The Mathematical Intelligencer (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03024378

zbMATH Keywords

Artin's conjectureFermat's last theoremcyclotomic fieldsEuclid's algorithmEuclidean function

Mathematics Subject Classification ID

Units and factorization (11R27) Iwasawa theory (11R23) Cyclotomic extensions (11R18) PV-numbers and generalizations; other special algebraic numbers; Mahler measure (11R06) Euclidean rings and generalizations (13F07) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (6)

A public-key cryptosystem utilizing cyclotomic fields ⋮ A search for Wilson primes ⋮ Upper bounds for Euclidean minima of algebraic number fields ⋮ Computation of the Euclidean minimum of algebraic number fields ⋮ On a proposition of Samuel and 2-stage Euclidean algorithm in global fields ⋮ Euclidean fields having a large Lenstra constant

Cites Work

• The background of Kummer's proof of Fermat's last theorem for regular primes
• On Euclidean rings of integers in cyclotomic fields.
• Euclid's Algorithm in Cyclotomic Fields
• Euclid's Algorithm in the Cyclotomic Field Q(ζ 16 )
• The Irregular Primes to 125000
• Euclid's algorithm in complex quartic fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Euclidean number fields. I. II. III