2000 character limit reached
ABC implies primitive prime divisors in arithmetic dynamic
Published 14 Aug 2012 in math.NT | (1208.2989v1)
Abstract: Let K be a number field, let f(x) in K(x) be a rational function of degree d> 1, and let z in K be a wandering point such that fn(z) is nonzero for all n > 0. We prove that if the abc-conjecture holds for K, then for all but finitely many positive integers n, there is a prime p of K such that p | fn(z) and p does not divide fm(z) for all positive integers m < n. We prove the same result unconditionally for function fields of characteristic 0 when f is not isotrivial.
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.