Displaying similar documents to “Pretentiousness in analytic number theory”

Almost powers in the Lucas sequence

Yann Bugeaud, Florian Luca, Maurice Mignotte, Samir Siksek (2008)

Journal de Théorie des Nombres de Bordeaux

Similarity:

The famous problem of determining all perfect powers in the Fibonacci sequence ( F n ) n ≥ 0 and in the Lucas sequence ( L n ) n ≥ 0 has recently been resolved []. 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 L n = q a y p , with a > 0 and p ≥ 2 , for all primes q < 1087 and indeed for all but 13 primes q < 10 6 . Here the strategy of [] is not sufficient due to the sizes...

Power-free values, large deviations, and integer points on irrational curves

Harald A. Helfgott (2007)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let f ∈ ℤ [ x ] be a polynomial of degree d ≥ 3 without roots of multiplicity d or ( d - 1 ) . Erdős conjectured that, if f satisfies the necessary local conditions, then f ( p ) is free of ( d - 1 ) th powers for infinitely many primes p . This is proved here for all f with sufficiently high entropy. The proof serves to demonstrate two innovations: a strong repulsion principle for integer points on curves of positive genus, and a number-theoretical analogue of Sanov’s theorem from the theory of large deviations. ...