Solving "a, b, a+b have given divisors" problem I've read an interesting article, math.NT/0409456 where you're just trying to solve a simple problem:

For a given (finite) set of primes S find all solutions to an equation a + b = c with the condition that all prime divisiors of integers a, b, c must be in S.

and this problem turns out to be very geometric. It turns out (and I tell that in comments below) you're actually dealing with sections of certain projective morphism of schemes R --> Spec ZZ \ S. The article then proves that the number of solutions to the equation is finite by proving that the number of these sections is finite.
Is there kind of general theory or other methods to prove things about sections of these maps? What is the intuition used here? Would there be a way to count these solutions?
 A: The original problem you mention is also known as the "S-unit equation":  see Wikipedia's page (http://en.wikipedia.org/wiki/S-unit_equation#S-unit_equation).  There's a fair amount of literature approaching this problem from a more classical direction, but only about proving that there are finitely many solutions/bounding the number of solutions, not counting the solutions (which seems to be pretty hard).
I haven't yet figured out what's going on with the connection to schemes, but it's pretty nifty that there is one!  
A: This sounds to me like it is related to some recent work of Lagarias and Soundararajan:
http://arxiv.org/pdf/0911.4147
Their paper has some relations to the ABC conjecture and to GRH. Hope this helps.
A: This is bound to be pretty hard! Knowing the prime divisors of a,b,c implies knowing the radical rad(abc) (the product of the distinct primes dividing abc), and then knowing the solutions a,b,c of a + b = c in positive integers, you would know the largest c with a,b,c coprime (pairwise or not, doesn't matter). So you would be in a position to settle the ABC conjecture c \leq C(epsilon)rad(abc)^{1 + \epsilon} if you could handle all those S-unit equations. The ABC conjecture is the outstanding problem in Diophantine analysis.
