A result about the primes dividing Fibonacci numbers (Q2765396)
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 1694694
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A result about the primes dividing Fibonacci numbers |
scientific article; zbMATH DE number 1694694 |
Statements
25 February 2003
0 references
Fibonacci numbers
0 references
divisibility by primes
0 references
A result about the primes dividing Fibonacci numbers (English)
0 references
The author proves the following theorem. If \(m\geq 3\), then with the exception of \(m=6\) and \(m=12\), \(F_m\) is divisible by some prime \(p\) which does not divide any \(F_k\), \(k<m\).
0 references
0.7753575444221497
0 references
0.7672996520996094
0 references
