Sources and Studies in the History of Mathematics and Physical Sciences 2008
DOI: 10.1007/978-0-387-72931-2
|View full text |Cite
|
Sign up to set email alerts
|

Fibonacci’s De Practica Geometrie

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
20
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 32 publications
(20 citation statements)
references
References 0 publications
0
20
0
Order By: Relevance
“…Contrary to methods often called evolution methods [20,21] which evolve one digit at the time, Fibonacci's method is a (front-end) recursion. In Hughes' translation of De Practica Geometrie [10] (p. 36), he demonstrates Fibonacci's square root computation of √ 864 in seven steps all based on the binomial expansion (1).…”
Section: Integer Part Of the Square Rootmentioning
confidence: 99%
See 4 more Smart Citations
“…Contrary to methods often called evolution methods [20,21] which evolve one digit at the time, Fibonacci's method is a (front-end) recursion. In Hughes' translation of De Practica Geometrie [10] (p. 36), he demonstrates Fibonacci's square root computation of √ 864 in seven steps all based on the binomial expansion (1).…”
Section: Integer Part Of the Square Rootmentioning
confidence: 99%
“…The recursive thinking is further evident in the example of √ 9,876,543 in De Practica Geometrie where Fibonacci consider the root of a seven digit number but first finds the root of the first five digits. The method used by Fibonacci is not the Hindu method described by Datta and Singh [9] (p. 169-175) as claimed in [10] (p. 35) or the computational method of al-Nasawī (c. 1011-c. 1075) where √ 57,342 is demonstrated [11]. In computing the integer part of the square root, a further misconception is that this is the Indian-Arabic algorithm [12].…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations