The arithmetic fractions in the work of Fibonacci: foundations \& uses (Q2355850): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 06:49, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The arithmetic fractions in the work of Fibonacci: foundations \& uses |
scientific article |
Statements
The arithmetic fractions in the work of Fibonacci: foundations \& uses (English)
0 references
28 July 2015
0 references
While Fibonacci transmitted computing with decimal numbers to Latin Europe, in the Arab tradition of ``Hindu numerals'' this referred only to integers. Decimal fractions appear only in the 17th century in Northern Europe. The basic tool of dealing with fractions is the Euclidean algorithm which by Fibonacci is used to write fractions as ascending continuous fractions, for which he invented a short-hand notation. Other notations are used for sums of products of fractions of different kinds, and for products of simple fractions. The emphasis here is on ascending continuous fractions since these represent a simple and unique normal form (called \textit{regula} by Fibonacci). The formalism of the different kinds of composites as well as determination of and computation with regulae are well explained in this paper, to which an exhaustive bibliography of the subject is added. (Correction to the bibliography: The edition and translation of Kūshyār ibn Labbān's ``Principles of Hindu reckoning'' [Zbl 0137.24602] is by Martin Levey and Marvin Petruck.)
0 references