An algorithm for finding an algebraic number whose norm is a given rational number.

DOI10.1515/crll.1980.316.1zbMath0421.12002OpenAlexW148842580MaRDI QIDQ3853730

Dennis A. Garbanati

Publication date: 1980

Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/152236

zbMATH Keywords

finite abelian extensionfinite procedureimage of norm map

Mathematics Subject Classification ID

Galois theory (11R32) Radix representation; digital problems (11A63) Cyclotomic extensions (11R18)

Related Items (6)

Distribution of prime ideals of higher residue degree across ideal classes in the class groups ⋮ Solving norm equations in relative number fields using $S$-units ⋮ Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares ⋮ Computing Square Roots in Quaternion Algebras ⋮ Trivializing a central simple algebra of degree 4 over the rational numbers. ⋮ Diophantine equations and class numbers

This page was built for publication: An algorithm for finding an algebraic number whose norm is a given rational number.