Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4582527 | Expositiones Mathematicae | 2007 | 5 Pages |
Abstract
It is well-known that the Fibonacci numbers have a maximum property with respect to the length of the regular continued fraction expansion (or, equivalently, of the Euclidean algorithm). But it seems to be scarcely known that they also have a minimum property relative to the sum of the digits of this expansion. We discuss both properties and their interrelation here.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Kurt Girstmair,