Addendum to the paper:"On two theorems of Gelfond and some of their applications" (Acta Arith. 13 (1967), pp. 177-236)
The famous problem of determining all perfect powers in the Fibonacci sequence and in the Lucas sequence has recently been resolved [10]. The proofs of those results combine modular techniques from Wiles’ proof of Fermat’s Last Theorem with classical techniques from Baker’s theory and Diophantine approximation. In this paper, we solve the Diophantine equations , with and , for all primes and indeed for all but primes . Here the strategy of [10] is not sufficient due to the sizes of...
We provide a lower bound for the number of distinct zeros of a sum for two rational functions , in term of the degree of , which is sharp whenever have few distinct zeros and poles compared to their degree. This sharpens the “-theorem” of Brownawell-Masser and Voloch in some cases which are sufficient to obtain new finiteness results on diophantine equations over function fields. For instance, we show that the Fermat-type surface contains only finitely many rational or elliptic curves,...
This is an exposition of the recent work of Bugeaud, Hanrot and Mihăilescu showing that Catalan’s conjecture can be proved without using logarithmic forms and electronic computations.
The subject of the talk is the recent work of Mihăilescu, who proved that the equation has no solutions in non-zero integers and odd primes . Together with the results of Lebesgue (1850) and Ko Chao (1865) this implies the celebratedconjecture of Catalan (1843): the only solution to in integers and is . Before the work of Mihăilescu the most definitive result on Catalan’s problem was due to Tijdeman (1976), who proved that the solutions of Catalan’s equation are bounded by an absolute...