A supplement to J. Shallit's paper ``Origins of the analysis of the Euclidean algorithm'' (Q1908667): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/hmat.1995.1033 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054614144 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q61534966 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Origins of the analysis of the Euclidean algorithm / rank | |||
Normal rank | |||
Latest revision as of 11:00, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A supplement to J. Shallit's paper ``Origins of the analysis of the Euclidean algorithm'' |
scientific article |
Statements
A supplement to J. Shallit's paper ``Origins of the analysis of the Euclidean algorithm'' (English)
0 references
28 July 1996
0 references
Dieser Aufsatz ergänzt den von \textit{J. Shallit} in Hist. Math. 21, 401-419 (1994). Es wird gezeigt, daß der deutsche Rechenmeister Simon Jacob bereits im 16. Jahrhundert bemerkte, daß der worst case beim Euklidischen Algorithmus dann auftritt, wenn man ihn auf die Gleichvielfachen zweier aufeinanderfolgender Glieder der Fibonacci-Folge angewendet.
0 references
Euclidean algorithm
0 references
Simon Jacob
0 references
worst case analysis
0 references
