[n4r9]

This would definitely benefit from a bit more explanatory text as I'm struggling to understand what you've shown. The crux seems to be that if a^n+b^n=c^n then (c-a)(c-b) divides (a+b-c)^n. I haven't been through all the details of this, but I also don't see how that implies FLT.

[hughesjj]

If I'm not mistaken Fermat's last theroem isn't even featured in the proof. Like nowhere did I see a^n+b^n=c^n referenced in the proof,save for the end of page 1 and 3, but it's never featured in an equality. Just 'this implies this trust me bro'.

[n4r9]

I've actually had another quick look and I now have a vague idea of the outline. It's an attempted proof by contradiction, where a solution to FLT is applied to the binomial theorem and some arguments about integrality are made to form a contradiction.

My issue at the moment is with a line at the bottom of p.4, which effectively says that if k^n = xy for integers k, n, x, y, then k must be a multiple of y. Unless I'm missing something this is clearly false, for example 2^4 = 4 x 4.