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
Created claim: DBLP publication ID (P1635): journals/ijmmsc/Marques11, #quickstatements; #temporary_batch_1731543907597
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2011/407643 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067820165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of primitive divisors of Lucas and Lehmer numbers / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ijmmsc/Marques11 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:29, 14 November 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