So now that we have this, what should we do to get a contradiction
and prove that there's no maximum prime number?
So the possibilities are to: divide by Q;
to divide by P i;
or try proof by intimidation.
This is an especially effective proof technique when we're proving something that Euclid already proved.
