Fibonacci Facts and Formulas
Identifieur interne : 002119 ( Main/Exploration ); précédent : 002118; suivant : 002120Fibonacci Facts and Formulas
Auteurs : R. M. Capocelli [Italie] ; G. Cerbone [États-Unis] ; P. Cull [États-Unis] ; J. L. Holloway [États-Unis]Source :
Abstract
Abstract: We investigate several methods of computing Fibonacci numbers quickly and generalize some properties of the Fibonacci numbers to degree r Fibonacci (R-nacci) numbers. Sections 2 and 3 present several algorithms for computing the traditional, degree two, Fibonacci numbers quickly. Sections 4 and 5 investigate the structure of the binary representation of the Fibonacci numbers. Section 6 shows how the generalized Fibonacci numbers can be expressed as rounded powers of the dominant root of the characteristic equation. Properties of the roots of the characteristic equation of the generalized Fibonacci numbers are presented in Section 7. Section 8 introduces several properties of the Zeckendorf representation of the integers. Finally, in Section 9 the asymptotic proportion of l’s in the Zeckendorf representation of integers is computed and an easy to compute closed formula is given.
Url:
DOI: 10.1007/978-1-4612-3352-7_9
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000250
- to stream Istex, to step Curation: 000250
- to stream Istex, to step Checkpoint: 000E50
- to stream Main, to step Merge: 002221
- to stream Main, to step Curation: 002119
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Fibonacci Facts and Formulas</title><author><name sortKey="Capocelli, R M" sort="Capocelli, R M" uniqKey="Capocelli R" first="R. M." last="Capocelli">R. M. Capocelli</name></author><author><name sortKey="Cerbone, G" sort="Cerbone, G" uniqKey="Cerbone G" first="G." last="Cerbone">G. Cerbone</name></author><author><name sortKey="Cull, P" sort="Cull, P" uniqKey="Cull P" first="P." last="Cull">P. Cull</name></author><author><name sortKey="Holloway, J L" sort="Holloway, J L" uniqKey="Holloway J" first="J. L." last="Holloway">J. L. Holloway</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:ED0710629A41A59B4F0D8239054970CDAB13774D</idno><date when="1990" year="1990">1990</date><idno type="doi">10.1007/978-1-4612-3352-7_9</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-65HLLFPK-K/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000250</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000250</idno><idno type="wicri:Area/Istex/Curation">000250</idno><idno type="wicri:Area/Istex/Checkpoint">000E50</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000E50</idno><idno type="wicri:Area/Main/Merge">002221</idno><idno type="wicri:Area/Main/Curation">002119</idno><idno type="wicri:Area/Main/Exploration">002119</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Fibonacci Facts and Formulas</title><author><name sortKey="Capocelli, R M" sort="Capocelli, R M" uniqKey="Capocelli R" first="R. M." last="Capocelli">R. M. Capocelli</name><affiliation wicri:level="1"><country xml:lang="fr">Italie</country><wicri:regionArea>Dipartimento di Informatica ed Applocazioni, Universita’ di Salerno, 84100, Salerno</wicri:regionArea><wicri:noRegion>Salerno</wicri:noRegion></affiliation></author><author><name sortKey="Cerbone, G" sort="Cerbone, G" uniqKey="Cerbone G" first="G." last="Cerbone">G. Cerbone</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science, Oregon State University, 97331, Corvallis, Oregon</wicri:regionArea><placeName><region type="state">Oregon</region></placeName></affiliation></author><author><name sortKey="Cull, P" sort="Cull, P" uniqKey="Cull P" first="P." last="Cull">P. Cull</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science, Oregon State University, 97331, Corvallis, Oregon</wicri:regionArea><placeName><region type="state">Oregon</region></placeName></affiliation></author><author><name sortKey="Holloway, J L" sort="Holloway, J L" uniqKey="Holloway J" first="J. L." last="Holloway">J. L. Holloway</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science, Oregon State University, 97331, Corvallis, Oregon</wicri:regionArea><placeName><region type="state">Oregon</region></placeName></affiliation></author></analytic><monogr></monogr></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We investigate several methods of computing Fibonacci numbers quickly and generalize some properties of the Fibonacci numbers to degree r Fibonacci (R-nacci) numbers. Sections 2 and 3 present several algorithms for computing the traditional, degree two, Fibonacci numbers quickly. Sections 4 and 5 investigate the structure of the binary representation of the Fibonacci numbers. Section 6 shows how the generalized Fibonacci numbers can be expressed as rounded powers of the dominant root of the characteristic equation. Properties of the roots of the characteristic equation of the generalized Fibonacci numbers are presented in Section 7. Section 8 introduces several properties of the Zeckendorf representation of the integers. Finally, in Section 9 the asymptotic proportion of l’s in the Zeckendorf representation of integers is computed and an easy to compute closed formula is given.</div></front></TEI><affiliations><list><country><li>Italie</li><li>États-Unis</li></country><region><li>Oregon</li></region></list><tree><country name="Italie"><noRegion><name sortKey="Capocelli, R M" sort="Capocelli, R M" uniqKey="Capocelli R" first="R. M." last="Capocelli">R. M. Capocelli</name></noRegion></country><country name="États-Unis"><region name="Oregon"><name sortKey="Cerbone, G" sort="Cerbone, G" uniqKey="Cerbone G" first="G." last="Cerbone">G. Cerbone</name></region><name sortKey="Cull, P" sort="Cull, P" uniqKey="Cull P" first="P." last="Cull">P. Cull</name><name sortKey="Holloway, J L" sort="Holloway, J L" uniqKey="Holloway J" first="J. L." last="Holloway">J. L. Holloway</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Sante/explor/H2N2V1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002119 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002119 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Sante
|area= H2N2V1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:ED0710629A41A59B4F0D8239054970CDAB13774D
|texte= Fibonacci Facts and Formulas
}}
| This area was generated with Dilib version V0.6.33. |  |