J. Mc Laughlin
Published 2001-10-15, updated 2002-02-16Version 2
It is shown that there are no non-trivial fifth-, seventh-, eleventh-, thirteenth- or seventeenth powers in the Fibonacci sequence. For eleventh, thirteenth- and seventeenth powers an alternative (to the usual exhaustive check of products of powers of fundamental units) method is used to overcome the problem of having a large number of independent units and relatively high bounds on their exponents. It is envisaged that the same method can be used to decide the question of the existence of higher small prime powers in the Fibonacci sequence and that the method can be applied to other binary recurrence sequences. The alternative method mentioned may have wider applications.
Comments: 22 pages. In the previous version of this paper my use of the GP/PARI command "bnfinit" meant that further work was necessary to show that the systems of units produced were indeed fundamental systems. The necessary further work has been included here (see page 10 of the paper for a more detailed explanation)
The Fibonacci Sequence is Normal Base 10
Walking to Infinity on the Fibonacci Sequence
Bounds on the number of squares in recurrence sequences
![QR code for arXiv:math/0110150 [math.NT]](http://oss.arxitics.com/images/favicon.svg)