{'fraction_non_alphanumeric': 0.02880184331797235, 'fraction_numerical': 0.004608294930875576, 'mean_word_length': 4.081871345029239, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 2, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 2, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Proof of Fermat Last Theorem Based on Odd Even Classification of Integers

In the middle of 17th century, Pierre de Fermat mentioned that no value of n > 2 could satisfy the equation x n + y n = z n , where n, x, y and z are all positive integers. The statement is popularly known as Fermat’s last theorem. An acceptable mathematical proof of this theorem is being explored still today. When searched online treasures of resources, one may find various proofs of this theorem. In this paper I am not discussing any historical attempts that failed or partially succeeded. I am going to discuss the approach which I have adopted to proof this theorem. The approach is based on odd-even classification of positive integers. Assumption that the equation x n + y n = z n , where n, x, y and z are all positive integers, has a solution for n > 2 leads to some contradiction.