I'm not sure how to do this: 

show that $(x + 12y)^{13}\equiv x^{13}  - y^{13} {\mod 13}$ for all integers

It's part of a question on the binomial theorem, but that's all I've got. 

You can think of the long exact sequence 
$$0\longrightarrow M_1\stackrel{\phi_1}{\longrightarrow}M_2\stackrel{\phi_2}{\longrightarrow}M_3\stackrel{\phi_3}{\longrightarrow}M_4\stackrel{\phi_4}{\longrightarrow}\cdots$$
as a collection of short exact sequences
$$0\longrightarrow M_1\stackrel{\phi_1}{\longrightarrow}M_2\stackrel{\phi_2}{\longrightarrow}\mathrm{Image}(\phi_2)\longrightarrow 0$$
$$0\longrightarrow\mathrm{Coker}(\phi_2)\stackrel{\phi_3}{\longrightarrow} M_4\stackrel{\phi_4}{\longrightarrow}\mathrm{Image}(\phi_4)\longrightarrow 0$$
$$\vdots$$
where each sequence after the first begins with the relevant cokernel (well, so does the first, but this is just $M_1$) and ends with the relevant image. I have abused notation here by writing $\phi_n$ for the maps from the cokernel which where originally from the corresponding module; this is not a serious issue because exactness of the original sequence ensures that the natural maps (defined by sending an equivalence class to the image of a representative) will be well-defined. One could write this as a single long chain like you proposed, but I prefer not to.