Upper bound on the solution to F(2k)n = +F(2k)m with negative subscripts (Q6045442)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7689912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bound on the solution to F(2k)n = +F(2k)m with negative subscripts |
scientific article; zbMATH DE number 7689912 |
Statements
Upper bound on the solution to F(2k)n = +F(2k)m with negative subscripts (English)
0 references
31 May 2023
0 references
\(k\)-generalized Fibonacci sequence
0 references
total multiplicity
0 references
0.7896763682365417
0 references
0.7654317617416382
0 references
0.7612785696983337
0 references
0.7587491273880005
0 references
0.7573859095573425
0 references
