“…For example, in 1984 Evertse [10] used Diophantine approximation methods to give upper bounds, depending only on s (and, in the number field case, also the degree of the field), for the number of S-unit solutions to equations like a + 1 = c. In 1988, Erdős, Stewart and Tijdeman [9] used methods from combinatorial number theory, in particular some results they proved about the largest prime factor of a product of sums, to show the existence of sets S for which a + b = c has many S-unit solutions with a, b, c coprime integers. In 2003, Evertse, Moree, Stewart and Tijdeman [11] gave an extension of Erdős, Stewart and Tijdeman's result to weighted S-unit equations in n variables 1 (as Date: 18th August 2011. The author is supported by a studentship from the Engineering and Physical Sciences Research Council of the United Kingdom.…”