A CLASSICAL CONTRADICTION-BASED PROOF OF FERMAT'S LAST THEOREM VIA SYMBOLIC GROWTH CONSTRAINTS

We present a classical contradiction-based proof of Fermat’s Last Theorem
using symbolic exclusion and arithmetic growth constraints. Assuming the existence of nontrivial integer solutions to the equation a^n +b^n = c^n for n ≥ 3, we construct an exclusion model for additive n-th power decompositions and show that the symbolic entropy required to encode such structures exceeds the compression bounds permitted by known divisor growth and power-sum representations. Specifically, we prove that the structural complexity of representing nontrivial power-sum identities grows faster than the admissible encoding density dictated by the distribution of perfect powers and multiplicative residues. This contradiction rules out the possibility of any nontrivial solution for n ≥ 3, yielding a classical
analytic proof of Fermat’s Last Theorem.