Reachability of inequalities from Lame's theorem
Dal'nevostochnyi Matematicheskii Zhurnal · 17.06.2024 · 24 (1) · 45-54
DOI: 10.47910/femj202405 ↗Kurz gefasst
Fachartikel in der Zeitschrift Dal'nevostochnyi Matematicheskii Zhurnal, erschienen am 17.06.2024. Verfasst von I.D. Kan. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
In this paper, the following result is proved. The number of steps in Euclid's algorithm for two natural arguments, the smaller of which has $v$ digital digits in the decimal system, does not exceed the integer part of the fraction $(v+\lg ({\sqrt{5}}/{\Phi}))/ \lg\Phi$, where $\Phi=(1+\sqrt{5})/2$, and this estimate is achieved for every natural $v$. It is also proved that partial or asymptotic reachability is valid for the other two known upper bounds on the length of the Euclid algorithm.
Zitieren
APA
Kan, I. (2024). Reachability of inequalities from Lame's theorem. Dal'nevostochnyi Matematicheskii Zhurnal, 24(1), 45-54. https://doi.org/10.47910/femj202405
Vancouver
Kan I. Reachability of inequalities from Lame's theorem. Dal'nevostochnyi Matematicheskii Zhurnal. 2024;24(1):45-54. doi:10.47910/femj202405
BibTeX
@article{Kan2024,
author = {Kan, I.D.},
title = {Reachability of inequalities from Lame's theorem},
journal = {Dal'nevostochnyi Matematicheskii Zhurnal},
year = {2024},
volume = {24},
number = {1},
pages = {45--54},
doi = {10.47910/femj202405}
}
EUVIMED