Minimal Number of Steps in Euclidean Algorithm and its Application to Rational Tangles
From MaRDI portal
Publication:4691571
zbMath1398.11008arXiv1311.7171MaRDI QIDQ4691571
Publication date: 24 October 2018
Full work available at URL: https://arxiv.org/abs/1311.7171
Number-theoretic algorithms; complexity (11Y16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items (1)
This page was built for publication: Minimal Number of Steps in Euclidean Algorithm and its Application to Rational Tangles