On integer numbers with locally smallest order of appearance in the Fibonacci sequence (Q539364): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58687777, #quickstatements; #temporary_batch_1705829395789
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 06:57, 30 January 2024

scientific article
Language Label Description Also known as
English
On integer numbers with locally smallest order of appearance in the Fibonacci sequence
scientific article

    Statements

    On integer numbers with locally smallest order of appearance in the Fibonacci sequence (English)
    0 references
    0 references
    27 May 2011
    0 references
    Summary: Let \(F_n\) be the be the \(n\)th Fibonacci number. The order of appearance \(z(n)\) of a natural number \(n\) is defined as the smallest natural number \(k\) such that \(n\) divides \(F_n\). For instance, for all \(n=F_m \geq 5\), we have \(z(n-1)> z(n) < z(n-1)\). In this paper, we will construct infinitely many natural numbers satisfying the previous inequalities and which do not belong to the Fibonacci sequence.
    0 references
    Fibonacci sequence
    0 references
    Fibonacci entry point
    0 references
    Binet's formula
    0 references

    Identifiers