On Radix Representation and the Euclidean Algorithm

DOI10.2307/2316801zbMATH Open0169.36804OpenAlexW4248203864MaRDI QIDQ5556558

George E. Andrews

Publication date: 1969

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2316801

zbMATH Keywords

number theory

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On Euclid's algorithm and elementary number theory 👍 👎
• The Euclidean algorithm in algebraic number fields 👍 👎
• Acceleration of Euclidean Algorithm and Rational Number Reconstruction 👍 👎
• The Euclidean algorithm for number fields and primitive roots 👍 👎
• On Euclid's Algorithm in Cyclic Fields 👍 👎

This page was built for publication: On Radix Representation and the Euclidean Algorithm

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