On integer numbers with locally smallest order of appearance in the Fibonacci sequence (Q539364): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: DBLP publication ID (P1635): journals/ijmmsc/Marques11, #quickstatements; #temporary_batch_1731543907597 |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
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
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
