Zobrazit minimální záznam
| dc.rights.license |
CC BY |
eng |
| dc.contributor.author |
Marques, Diego |
cze |
| dc.contributor.author |
Trojovský, Pavel |
cze |
| dc.date.accessioned |
2026-07-08T07:49:03Z |
|
| dc.date.available |
2026-07-08T07:49:03Z |
|
| dc.date.issued |
2022 |
eng |
| dc.identifier.issn |
1029-242X |
eng |
| dc.identifier.uri |
http://hdl.handle.net/20.500.12603/2648 |
|
| dc.description.abstract |
Let (F-n)(n) be the Fibonacci sequence defined by Fn+2 = Fn+1 + F-n with F-0 = 0 and F-1 = 1. In this paper, we prove that for any integer m >= 1 there exists a positive constant C-m for which lim(n ->infinity){(Sigma(infinity)(k=n)1/F-mk(2))(-1) - (F-mn(2)-F-m(n-1)(2) + (-1)C-mn(m))} = 0. Furthermore, we show that C-m tends to 2/5 as m ->infinity (indeed, we provide quantitative versions of the previous results as well as an explicit form for C-m). This confirms some questions proposed by Lee and Park [J. Inequal. Appl. 2020(1):91 2020]. |
eng |
| dc.format |
p. "Article Number: 21" |
eng |
| dc.language.iso |
eng |
eng |
| dc.publisher |
Springer |
eng |
| dc.relation.ispartof |
Journal of Inequalities and Applications, volume 2022, issue: 1 |
eng |
| dc.subject |
Fibonacci numbers |
eng |
| dc.subject |
Series |
eng |
| dc.subject |
Upper bounds |
eng |
| dc.subject |
Inequalities |
eng |
| dc.subject |
Asymptotic |
eng |
| dc.subject |
Recurrence sequences |
eng |
| dc.title |
The proof of a formula concerning the asymptotic behavior of the reciprocal sum of the square of multiple-angle Fibonacci numbers |
eng |
| dc.type |
article |
eng |
| dc.identifier.obd |
43878605 |
eng |
| dc.identifier.doi |
10.1186/s13660-022-02755-7 |
eng |
| dc.publicationstatus |
postprint |
eng |
| dc.peerreviewed |
yes |
eng |
| dc.source.url |
https://journalofinequalitiesandapplications.springeropen.com/articles/10.1186/s13660-022-02755-7 |
cze |
| dc.relation.publisherversion |
https://journalofinequalitiesandapplications.springeropen.com/articles/10.1186/s13660-022-02755-7 |
eng |
| dc.rights.access |
Open Access |
eng |
Soubory tohoto záznamu
Tento záznam se objevuje v následujících kolekcích
Zobrazit minimální záznam