Cartesian and Euler area binary arithmetic glued intersection points that both satisfy and contradict Fermat's last theorem or formulae if n > 2

thinking ....  how about? .....imagining a Vacuum Surface covered by Cartesian and Euler area binary arithmetic glued intersection points that both satisfy and contradict Fermat's last theorem for natural number line  n = n + 1 endpoints 'n' ≤ (((1/n!)^-1) +1)  ≤  (((1/n!)^-1) +0) ≤ (((1/n!)^-1) -1) each a triangle vertices with grid coordinate (n, n, n) point label dependent on what natural number line subfield endpoint 'n' has choice of prime or composite natural number solvable only for orthogonal line intersection 2•D dimensional boundary space restricted to points that maximum boundary vector space intersection point is determined by Fermat theorem constraint  X^n + Y^n  = Z^n  is false theorem or formulae if n > 2