Afficher la notice abrégée
| dc.rights.license |
CC BY |
eng |
| dc.contributor.author |
Trojovská, Eva |
cze |
| dc.date.accessioned |
2025-12-05T08:41:34Z |
|
| dc.date.available |
2025-12-05T08:41:34Z |
|
| dc.date.issued |
2020 |
eng |
| dc.identifier.issn |
2227-7390 |
eng |
| dc.identifier.uri |
http://hdl.handle.net/20.500.12603/975 |
|
| dc.description.abstract |
Let $(F_n)_{n\geq 0}$ be the sequence of the Fibonacci numbers. The order (or rank) of appearance $z(n)$ of a positive integer $n$ is defined as the smallest positive integer $m$ such that $n$ divides $F_m$. In 1975, Sall\' e proved that $z(n)\leq 2n$, for all positive integers $n$. In this paper, we shall solve the Diophantine equation $z(n)=(2-1/k)n$ for positive integers $n$ and $k$. |
eng |
| dc.format |
p. "Article Number: 124" |
eng |
| dc.language.iso |
eng |
eng |
| dc.publisher |
MDPI-Molecular diversity preservation international |
eng |
| dc.relation.ispartof |
Mathematics, volume 8, issue: 1 |
eng |
| dc.subject |
Diophantine equation |
eng |
| dc.subject |
asymptotic |
eng |
| dc.subject |
Fibonacci numbers |
eng |
| dc.subject |
order (rank) of appearance |
eng |
| dc.subject |
$p$-adic~valuation. |
eng |
| dc.subject |
Diofantická rovnice |
cze |
| dc.subject |
asymptotický |
cze |
| dc.subject |
Fibonacciho číslo |
cze |
| dc.subject |
řád výskytu ve Fibonacciho posloupnosti |
cze |
| dc.subject |
$p$-adický řád. |
cze |
| dc.title |
On the Diophantine Equation $z(n)=(2-1/k)\,n$ Involving the Order of Appearance in the Fibonacci Sequence |
eng |
| dc.title.alternative |
O diofantické rovnici $z(n)=(2-1/k)\,n$ obsahující řád výskytu ve Fibonacciho posloupnosti |
cze |
| dc.type |
article |
eng |
| dc.identifier.obd |
43876238 |
eng |
| dc.identifier.doi |
10.3390/math8010124 |
eng |
| dc.description.abstract-translated |
Let $(F_n)_{n\geq 0}$ be the sequence of the Fibonacci numbers. The order (or rank) of appearance $z(n)$ of a positive integer $n$ is defined as the smallest positive integer $m$ such that $n$ divides $F_m$. In 1975, Sall\' e proved that $z(n)\leq 2n$, for all positive integers $n$. In this paper, we shall solve the Diophantine equation $z(n)=(2-1/k)n$ for positive integers $n$ and $k$. |
cze |
| dc.publicationstatus |
postprint |
eng |
| dc.peerreviewed |
yes |
eng |
| dc.source.url |
https://www.mdpi.com/2227-7390/8/1/124 |
cze |
| dc.relation.publisherversion |
https://www.mdpi.com/2227-7390/8/1/124 |
eng |
| dc.rights.access |
Open Access |
eng |
Fichier(s) constituant ce document
Ce document figure dans la(les) collection(s) suivante(s)
Afficher la notice abrégée