Let me give you a feel for what's involved. From the preface:
It goes on in a similar vein. First, there's some instructive material on Pythagorean triples. There's an algorithm for producing Pythagorean triples. Choose any two integers a, b, satisfying a > b > 0; then define x = 2ab, y = a2 - b2, and z = a2 + b2. But we're not interested in simply producing all the Pythagorean triples (a countable infinity; use the same method you'd use to count the rationals.) It's the primitive solutions we're after; namely, those for which gcd(a,b,c) = gcd(x,y,z) = 1. That makes possible the development of Fermat's first result, X4 - Y4 = Z2 has no solution in integers all different from zero. I want to work through all this as Ribenboim addresses something that once occurred to me: perhaps the last theorem is Fermat's method of infinite descent, which does work for even powers, although (and perhaps he discovered this later) it fails for powers that are odd primes. Whew. Bedtime, and some lighter reading.
The following general remarks are quite obvious and henceforth will be taken for granted.
If n is odd then Xn + Yn = Zn has a non-trivial solution if and only if
Xn + Yn + Zn = 0 has a non-trivial solution.
If x,y,z are non-zero integers such that xn + yn = zn, if d = gcd(x,y,z) and x1 = x/d, y1 = y/d, z1 = z/d then x1n + y1n = z1n, where the non-zero integers x1, y1, z1 are pairwise relatively prime. So, if we assume that Fermat's equation has a non-trivial solution, then it has one with pairwise relatively prime integers.