Common factors of shifted Fibonacci numbers (Q705710)
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 2133888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Common factors of shifted Fibonacci numbers |
scientific article; zbMATH DE number 2133888 |
Statements
Common factors of shifted Fibonacci numbers (English)
0 references
14 February 2005
0 references
The authors study the common factors of shifted Fibonacci numbers. For any positive integer \(n\) let \(F_n\) be the \(n\)th Fibonacci number. Given positive integers \(a\) and \(b\), they give effectively computable bounds for the greatest common divisor of \(F_n+a\) and \(F_m+b\) for varying positive integers \(m\) and \(n\).
0 references
Fibonacci numbers
0 references
Euclidean algorithm
0 references
subspace theorem
0 references
0.8631766438484192
0 references
0.8594814538955688
0 references
