Add proof of fundamental theorem of arithmetic

[rzach]

computability/recursive-functions/sequences.tex uses the fundamental theorem of arithmetic to code sequences. Should add a proof of this. Since both existence and uniqueness proofs use strong induction, it might fit as an example in methods/induction/strong-induction.tex