2000 character limit reached
Powers in Lucas Sequences via Galois Representations
Published 18 Jul 2013 in math.NT | (1307.5078v2)
Abstract: Let $u_n$ be a nondegenerate Lucas sequence. We generalize the results of Bugeaud, Mignotte, and Siksek, 2006 to give a systematic approach towards the problem of determining all perfect powers in any particular Lucas sequence. We then prove a general bound on admissible prime powers in a Lucas sequence assuming the Frey-Mazur conjecture on isomorphic mod $p$ Galois representations of elliptic curves.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.