is known to have only finitely many triples of positive integer solutions x, y, z for a given n > 2 (Faltings, 1983). In Chapter 11, special situations are described in which more precise information is accessible. For example, if x is in S, then n is bounded by a computable number C5 = Cb(pv ..., p8). From these examples, it should be clear that the book is a mine of information for workers in...