Skip to main content

Chapter 8 Multiplicative theory of integers

This week we will study the integers, particularly the techniques of studying divisibility, the highest common factor, and prime factorization.

These techniques are especially useful for solving diophantine equations, which are polynomial equations where we seek integer solutions. The most famous diophantine equation is

\begin{equation*} x^{n}+y^{n}=z^{n} \end{equation*}

It was famously claimed by Fermat (without proof) that there are solutions \(x,y,z,n\in\NN\) only if \(n=1\) or \(n=2\text{.}\) It wasn't until 1994 when Andrew Wiles actually gave a proof.

This week's set of tools are also useful when we are trying to show at a diophantine can't be solved. You have seen one such proof before: that \(\sqrt{2}\) is irrational. Let's recall the proof briefly:

Suppose there was a rational number \(\frac{m}{n}\) (where \(m\) and \(n\) are reduced in the sense that they have no common divisors apart from \(1\)) so that \(\left(\frac{m}{n}\right)^2=2\text{,}\) then \(m^2=2n^2\text{.}\) This means that \(m^2\) is even. Then \(m\) must be even since, if instead \(m=2k+1\) for some integer \(k\text{,}\) then \(m^2=(2k+1)^2=4(k^2+k)+1\text{,}\) which is odd, a contradiction. Hence, \(m=2k\) for some integer \(k\text{,}\) and so

\begin{equation*} 2n^2=m^2=(2k)^2=4k^2 \end{equation*}

and so \(n^2=2k^2\text{,}\) and using a similar reasoning, we get that \(n\) must also be even, which is a contradiction since we assumed \(m\) and \(n\) had no common factors, but now we have shown they are both divisible by \(2\text{.}\)

The important feature of the proof was to use the coprimality of \(m\) and \(n\text{,}\) that is, that they share no common divisors, as well as the fact that if \(m^2\) is divisible by \(2\) (that is, if \(m^2\) was even, then so was \(m\)). If we want to generalize this proof, we will need to develop these tools about divisibility and coprimality. Later, we will in fact show that \(\sqrt{n}\) is rational exactly when \(n=m^2\) for some integer \(m\text{.}\)

As motivation for the techniques we develop along the way, we will show how they can be used to solve various diophantine equations. As a special final application of these techniques, we'll also classify all Pythagorean Triples, that is, integers \(x,y,z\) so that

\begin{equation*} x^2+y^2=z^2\text{.} \end{equation*}