Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"Fibonacci numbers."”.

  1. Linear Forms in Logarithms and Fibonacci Numbers

    … Omar Kihel, pertaining to Diophantine triples of Fibonacci numbers. To go along with this will be introductory material not included in said paper which establishes the mathematical concepts therein and offers some historical perspective and motivation. The initial aim of the paper was to explore …

    brock Repository record for Linear Forms in Logarithms and Fibonacci Numbers (opens in a new tab)

  2. Around the Fibonacci Numeration System

    Let 1, 2, 3, 5, 8, … denote the Fibonacci sequence beginning with 1 and 2, and then setting each subsequent number to the sum of the two previous ones. Every positive integer n can be expressed as a sum of distinct Fibonacci numbers in one or more ways. Setting R(n) to be the number of ways n can …

    unt Repository record for Around the Fibonacci Numeration System (opens in a new tab)

  3. Space-Efficient and Noise-Robust Quantum Factoring

    … efficient and reversible exponentiation with Fibonacci numbers in the exponent, rather than the usual powers of 2, adapting work by Kaliski (arXiv:1711.02491) from the classical reversible setting to the quantum setting. This technique also allows us to perform quantum modular exponentiation …

    mit Repository record for Space-Efficient and Noise-Robust Quantum Factoring (opens in a new tab)

  4. On the Extendibility of a D(4)-Pair of Pell Numbers

    … that a particular family of D(4) pairs of Pell numbers can be extended to a D(4) triple by exactly one Pell number. A similar result has been found for the Diophantine triples of Fibonacci numbers, a discussion of which is included in the first chapter of this thesis. This chapter finishes with …

    brock Repository record for On the Extendibility of a D(4)-Pair of Pell Numbers (opens in a new tab)

  5. Parallel sorting and Star-P data movement and tree flattening

    … programming approach to the computation of Fibonacci numbers.

    mit Repository record for Parallel sorting and Star-P data movement and tree flattening (opens in a new tab)

  6. Isomorphisms amongst certain classes of cyclically presented groups

    … Repovs and Spaggiari. The abelianization of the Fibonacci groups F(2, n) was proved by Lyndon to be finite and its order can be expressed in terms of the Lucas numbers. Bardakov and Vesnin have asked if there is a formula for the order of the abelianization of G_n(m, k) groups that can be …

    essex Repository record for Isomorphisms amongst certain classes of cyclically presented groups (opens in a new tab)

  7. Aðferðir til sköpunar og greiningar punkta með netafræði

    … Til þess greinum við tvær punktamengi: Fibonacci-grindur (með ítarlega yfirferð á eiginleikum þeirra) og punktamengin sem hafa tengda β-grind fyrir óvenju hátt β. Sem partur af þessu verkefni þróuðum við skilvika útfærslu til að reikna β-grindir og önnur nándarnet af margvíðum …

    reykjavik Repository record for Aðferðir til sköpunar og greiningar punkta með netafræði (opens in a new tab)