Related papers: Annotated square root computation in Liber Abaci a…
The focus of this note is to formulate the algorithms and give the examples used by Fibonacci in Liber Abaci to expand any fraction into a sum of unit fractions. The description in Liber Abaci is all verbal and the examples are numbers…
The Fibonacci numbers are familiar to all of us. They appear unexpectedly often in mathematics, so much there is an entire journal and a sequence of conferences dedicated to their study. However, there is also another sequence of numbers…
This work presents and extends a known spigot-algorithm for computing square-roots, digit-by-digit, that is suitable for calculation by hand or an abacus, using only addition and subtraction. We offer an elementary proof of correctness for…
We reconsider Archimedes' evaluations of several square roots in 'Measurement of a Circle'. We show that several methods proposed over the last century or so for his evaluations fail one or more criteria of plausibility. We also provide…
In this paper, an optimized version of classical Bombelli's algorithm for computing integer square roots is presented. In particular, floating-point arithmetic is used to compute the initial guess of each digit of the root, following…
Confocal quadrics capture (encode) and geometrize spectral properties of symmetric operators. Certain metric-projective properties of confocal quadrics (most of them established in the first half of the XIX$^{\mathrm{th}}$ century) {\it…
This paper is a sharp and focussed exploration of the Fibonacci substitution and the mathematical entity it gives rise to, the Fibonacci word. Our investigations are both of an algebraic and a geometric nature. Indeed, it is the combination…
This article presents a new method for calculating square roots in GF(p) by exponentiating in GF(p^3) or equivalently modulo irreducible cubic polynomials. This algorithm is in some ways similar to the Cipolla-Lehmer algorithm which is…
We consider various properties and manifestations of some sign-alternating univariate polynomials borne of right-triangular integer arrays related to certain generalizations of the Fibonacci sequence. Using a theory of the root geometry of…
This paper explores the Fibonacci sequence and the Golden Ratio as organizing principles for visual composition and abstraction in painting. The author shows how recursive proportional systems, long associated with natural growth and…
In this paper, we provide new applications of Fibonacci and Lucas numbers. In some circumstances, we find algebraic structures on some sets defined with these numbers, we generalize Fibonacci and Lucas numbers by using an arbitrary binary…
Between the ninth and fifteenth centuries, several Arab mathematicians studied numerical algorithms on integers. The extraction of the square root of an integer is based on an algorithm known at least since al-Khwarizmi (died around 850)…
The Fibonacci numbers are a sequence of integers in which every number after the first two, 0 and 1, is the sum of the two preceding numbers. These numbers are well known and algorithms to compute them are so easy that they are often used…
Annotated parallel text in Latin and English of the classic paper of Adam Adamandy Kocha\'nski "Observationes Cyclometricae", published in Acta Eruditorum 4:394--398 (1685), in which he presented approximate geometric method of…
We study the p-rationality of real quadratic fields in terms of generalized Fibonacci numbers and their periods modulo positive integers.
This note generalizes the Fibonacci primitive roots to the set of integers. An asymptotic formula for counting the number of integers with such primitive root is introduced here.
We consider the Geometria Practica of Christopher Clavius, S.J., a suprisingly eclectic and comprehensive textbook of practical geometry, whose first edition appeared in 1604. Our focus is on four particular sections from Books IV and VI…
This paper presents geometric proofs for the irrationality of square roots of select integers, extending classical approaches. Building on known geometric methods for proving the irrationality of sqrt(2), the authors explore whether similar…
In this paper, we give a new representation of the Fibonacci numbers. This is achieved using Fibonacci trees. With the help of this representation, the nth Fibonacci number can be calculated without having any knowledge about the previous…
We consider the tiling of an $n$-board (a $1\times n$ array of square cells of unit width) with half-squares ($\frac12\times1$ tiles) and $(\frac12,\frac12)$-fence tiles. A $(\frac12,\frac12)$-fence tile is composed of two half-squares…