Is something wrong in this simple proof of FLT for n=3?












-1














According to Fermat´s last theorem, equality in $ x^n+y^n= z^n $ is not possible for positive integers x, y, z, n if n≥3 .



Following proof for n=3 is based upon the assumption that there is equality and that this assumption leads to contradiction. The assumption that there is equality in (I) $ x^3+y^3= z^3 $ for some positive integers x, y, z is combined with (II) ${zover{x+y}}=sqrt[3]{z^3over(x+y)^3}$. The combination leads to contradiction and shows that $ {zover {x+y}}$ is irrational, then at least one of x,y,z is irrational and $x^3+y^3neq z^3$.



Assume that $ x^3+y^3= z^3 $ is in its reduced form, where x, y, z are pairwise coprime.



Then, assume that there is equality in (I) $ x^3+y^3= z^3 $ for some positive integers x, y, z . The expression $zover{x+y}$ is a rational number. Whether $zover{x+y}$ is reduced or not is unknown.



A. In the case that $zover{x+y}$ is reduced $Rightarrow$ z and x+y are coprime. Let ${zover{x+y}}={rover s}$, where $rover s$ is reduced $Rightarrow$ r and s are coprime $Rightarrow$ $sqrt[3]{z^3over(x+y)^3}={rover s}$ ; ${z^3over(x+y)^3}={r^3over s^3}$



Since both sides of ${zover{x+y}}={rover s}$ are reduced $Rightarrow$
$s^3=(x+y)^3 $ and $r^3=z^3$. Insert (I) $Rightarrow$ $r^3= x^3+y^3=(x+y)(x^2-xy+y^2)$. But then $r^3$ and $s^3$ have a common factor $x+y$ $Rightarrow$ $r$ and $s$ have a common factor $Rightarrow$ contradiction $Rightarrow$ $zover{x+y}$ is
irrational $Rightarrow$ at least one of x,y,z is irrational $Rightarrow$
$x^3+y^3neq z^3$.



B. In the case that $zover{x+y}$ is not reduced $Rightarrow$ z and x+y have
a common factor k $Rightarrow$
$ {rover s}={{z/k}over{(x+y)/k}}$ . Let ${rover s}=sqrt[3] {{(z/k)^3}over{((x+y)/k)^3}}$;
${r^3over s^3}={{(z/k)^3}over{((x+y)/k)^3}}$ ; both sides of ${rover s}={{z/k}over{(x+y)/k}}$ are reduced $Rightarrow$
$s^3={{x+y}over k^3} $ and and $r^3={z^3over k^3}$. Insert (I) $Rightarrow$ $r^3={{x^3+y^3}over k^3}$ = ${{(x+y)(x^2-xy+y^2)}over k^3}$.



B1. $k$ but not $k^2$or $k^3$ divides $x+y$.



What seems to be a shared common factor between $s^3$ and $r^3$ is ${x+y}over k$, which is an integer, so there seems to be a contradiction. Since $r^3$ is an integer,${{x^2-xy+y^2}over k^2}$ should be an integer. But
$x^2-xy+y^2$ is coprime to $x+y$ (*See below) and is not divisible by $k^2$ (**See below) $Rightarrow$ ${{x^2-xy+y^2}over k^2}$ is not an integer $Rightarrow$ $r^3={z^3over k^3}$ is an integer, but $r^3={{x^3+y^3}over k^3}$ is not an integer. That is a contradiction $Rightarrow$
$x^3+y^3neq z^3$



B2. $k^3$ divides $x+y$ $Rightarrow$ $x^2-xy+y^2$ is an integer.



$r^3$ $={{x+y}over k^3}cdot {(x^2-xy+y^2)}$and ${s^3={{x+y}over k^3}}{cdot(x+y)^2}$ $Rightarrow$ $r^3$ and $s^3$ have a common factor ${{x+y}over k^3}$ $Rightarrow$ r and s have a common factor. That is a contradiction $Rightarrow$ $zover{x+y}$ is irrational $Rightarrow$ at least one of x,y,z is irrational $Rightarrow$$x^3+y^3neq z^3$.



B3. $k^2$ but not $k^3$ divides $x+y$. $Rightarrow$ $r^3$ $={{x+y}over k^2}cdot {{x^2-xy+y^2}over k}$ and $s^3={(x+y)over k^2}{cdot(x+y)^2over k}$. If $k=3$, $x^2-xy+y^2$ can be divided by 3 and the common factor is ${{x+y}over k^2}$ $Rightarrow$ contradiction like in B2.



If $kneq 3$ $Rightarrow$ $x^2-xy+y^2$ is not divided by $k$. $x^2-xy+y^2$ is not an integer.There is a contradiction the same way as in B1$Rightarrow$ $x^3+y^3neq z^3$.



Fermat´s last theorem is true for n=3.



*According to the conditions, x is coprime to y $Rightarrow$ x and y both are coprime to x+y. Also, $x+y$ and $x^2-xy+y^2=(x+y)^2-3xy$ have no common factors (if 3 is not the common factor, see **). If the differens ${(x+y)^2-3xy}$ had a factor in common with one of the terms $Rightarrow$ the other term would have the same factor. There is also a theorem which could be used. see this link:
If $n$ is an odd prime, and $a$ and $b$ are co-prime, and $a+b$ is not a multiple of $n$, prove that $frac{a^n+b^n}{a+b}$ is co-prime to $a+b$.



**If 3 divides x+y, then 3 does not divide x or y $Rightarrow$ $x^2-xy+y^2=(x+y)^2-3xy$ has at most one factor =3, since the expression is limited by the term $3xy$ which has only one factor 3 $Rightarrow$ $x+y$ and $x^2-xy+y^2$ have no common factors , if 3 is not the common factor $Rightarrow$ $x^2-xy+y^2$can not be divided by k, if $kneq3$. If k=3, $x^2-xy+y^2$ can be divided by 3 but not by $k^2=9$ $Rightarrow$ ${x^2-xy+y^2}over k^2$ is not an integer.










share|cite|improve this question




















  • 2




    Honestly, I'm too lazy to read through all of this, but I wouldn't be surprised if it were mostly accurate. The proof for $n=3$ is not that difficult.
    – Don Thousand
    Dec 20 at 17:16






  • 1




    See this
    – Don Thousand
    Dec 20 at 17:17






  • 2




    I don't think this is the correct place to ask for the correctness of such a long proof. Also, if you are interested, you can find a proof on Wikipedia (specific cases of FLT have been known for centuries).
    – user1729
    Dec 20 at 17:17










  • Thanks for comments.I now have edited and shortened it as much as possible, trying to make it easier to follow,and the math is really simple.I was hoping that if there is a serious flaw, someone could discover it.And I know of other proofs, but the links added some.
    – Ylvali
    Dec 23 at 22:28
















-1














According to Fermat´s last theorem, equality in $ x^n+y^n= z^n $ is not possible for positive integers x, y, z, n if n≥3 .



Following proof for n=3 is based upon the assumption that there is equality and that this assumption leads to contradiction. The assumption that there is equality in (I) $ x^3+y^3= z^3 $ for some positive integers x, y, z is combined with (II) ${zover{x+y}}=sqrt[3]{z^3over(x+y)^3}$. The combination leads to contradiction and shows that $ {zover {x+y}}$ is irrational, then at least one of x,y,z is irrational and $x^3+y^3neq z^3$.



Assume that $ x^3+y^3= z^3 $ is in its reduced form, where x, y, z are pairwise coprime.



Then, assume that there is equality in (I) $ x^3+y^3= z^3 $ for some positive integers x, y, z . The expression $zover{x+y}$ is a rational number. Whether $zover{x+y}$ is reduced or not is unknown.



A. In the case that $zover{x+y}$ is reduced $Rightarrow$ z and x+y are coprime. Let ${zover{x+y}}={rover s}$, where $rover s$ is reduced $Rightarrow$ r and s are coprime $Rightarrow$ $sqrt[3]{z^3over(x+y)^3}={rover s}$ ; ${z^3over(x+y)^3}={r^3over s^3}$



Since both sides of ${zover{x+y}}={rover s}$ are reduced $Rightarrow$
$s^3=(x+y)^3 $ and $r^3=z^3$. Insert (I) $Rightarrow$ $r^3= x^3+y^3=(x+y)(x^2-xy+y^2)$. But then $r^3$ and $s^3$ have a common factor $x+y$ $Rightarrow$ $r$ and $s$ have a common factor $Rightarrow$ contradiction $Rightarrow$ $zover{x+y}$ is
irrational $Rightarrow$ at least one of x,y,z is irrational $Rightarrow$
$x^3+y^3neq z^3$.



B. In the case that $zover{x+y}$ is not reduced $Rightarrow$ z and x+y have
a common factor k $Rightarrow$
$ {rover s}={{z/k}over{(x+y)/k}}$ . Let ${rover s}=sqrt[3] {{(z/k)^3}over{((x+y)/k)^3}}$;
${r^3over s^3}={{(z/k)^3}over{((x+y)/k)^3}}$ ; both sides of ${rover s}={{z/k}over{(x+y)/k}}$ are reduced $Rightarrow$
$s^3={{x+y}over k^3} $ and and $r^3={z^3over k^3}$. Insert (I) $Rightarrow$ $r^3={{x^3+y^3}over k^3}$ = ${{(x+y)(x^2-xy+y^2)}over k^3}$.



B1. $k$ but not $k^2$or $k^3$ divides $x+y$.



What seems to be a shared common factor between $s^3$ and $r^3$ is ${x+y}over k$, which is an integer, so there seems to be a contradiction. Since $r^3$ is an integer,${{x^2-xy+y^2}over k^2}$ should be an integer. But
$x^2-xy+y^2$ is coprime to $x+y$ (*See below) and is not divisible by $k^2$ (**See below) $Rightarrow$ ${{x^2-xy+y^2}over k^2}$ is not an integer $Rightarrow$ $r^3={z^3over k^3}$ is an integer, but $r^3={{x^3+y^3}over k^3}$ is not an integer. That is a contradiction $Rightarrow$
$x^3+y^3neq z^3$



B2. $k^3$ divides $x+y$ $Rightarrow$ $x^2-xy+y^2$ is an integer.



$r^3$ $={{x+y}over k^3}cdot {(x^2-xy+y^2)}$and ${s^3={{x+y}over k^3}}{cdot(x+y)^2}$ $Rightarrow$ $r^3$ and $s^3$ have a common factor ${{x+y}over k^3}$ $Rightarrow$ r and s have a common factor. That is a contradiction $Rightarrow$ $zover{x+y}$ is irrational $Rightarrow$ at least one of x,y,z is irrational $Rightarrow$$x^3+y^3neq z^3$.



B3. $k^2$ but not $k^3$ divides $x+y$. $Rightarrow$ $r^3$ $={{x+y}over k^2}cdot {{x^2-xy+y^2}over k}$ and $s^3={(x+y)over k^2}{cdot(x+y)^2over k}$. If $k=3$, $x^2-xy+y^2$ can be divided by 3 and the common factor is ${{x+y}over k^2}$ $Rightarrow$ contradiction like in B2.



If $kneq 3$ $Rightarrow$ $x^2-xy+y^2$ is not divided by $k$. $x^2-xy+y^2$ is not an integer.There is a contradiction the same way as in B1$Rightarrow$ $x^3+y^3neq z^3$.



Fermat´s last theorem is true for n=3.



*According to the conditions, x is coprime to y $Rightarrow$ x and y both are coprime to x+y. Also, $x+y$ and $x^2-xy+y^2=(x+y)^2-3xy$ have no common factors (if 3 is not the common factor, see **). If the differens ${(x+y)^2-3xy}$ had a factor in common with one of the terms $Rightarrow$ the other term would have the same factor. There is also a theorem which could be used. see this link:
If $n$ is an odd prime, and $a$ and $b$ are co-prime, and $a+b$ is not a multiple of $n$, prove that $frac{a^n+b^n}{a+b}$ is co-prime to $a+b$.



**If 3 divides x+y, then 3 does not divide x or y $Rightarrow$ $x^2-xy+y^2=(x+y)^2-3xy$ has at most one factor =3, since the expression is limited by the term $3xy$ which has only one factor 3 $Rightarrow$ $x+y$ and $x^2-xy+y^2$ have no common factors , if 3 is not the common factor $Rightarrow$ $x^2-xy+y^2$can not be divided by k, if $kneq3$. If k=3, $x^2-xy+y^2$ can be divided by 3 but not by $k^2=9$ $Rightarrow$ ${x^2-xy+y^2}over k^2$ is not an integer.










share|cite|improve this question




















  • 2




    Honestly, I'm too lazy to read through all of this, but I wouldn't be surprised if it were mostly accurate. The proof for $n=3$ is not that difficult.
    – Don Thousand
    Dec 20 at 17:16






  • 1




    See this
    – Don Thousand
    Dec 20 at 17:17






  • 2




    I don't think this is the correct place to ask for the correctness of such a long proof. Also, if you are interested, you can find a proof on Wikipedia (specific cases of FLT have been known for centuries).
    – user1729
    Dec 20 at 17:17










  • Thanks for comments.I now have edited and shortened it as much as possible, trying to make it easier to follow,and the math is really simple.I was hoping that if there is a serious flaw, someone could discover it.And I know of other proofs, but the links added some.
    – Ylvali
    Dec 23 at 22:28














-1












-1








-1


1





According to Fermat´s last theorem, equality in $ x^n+y^n= z^n $ is not possible for positive integers x, y, z, n if n≥3 .



Following proof for n=3 is based upon the assumption that there is equality and that this assumption leads to contradiction. The assumption that there is equality in (I) $ x^3+y^3= z^3 $ for some positive integers x, y, z is combined with (II) ${zover{x+y}}=sqrt[3]{z^3over(x+y)^3}$. The combination leads to contradiction and shows that $ {zover {x+y}}$ is irrational, then at least one of x,y,z is irrational and $x^3+y^3neq z^3$.



Assume that $ x^3+y^3= z^3 $ is in its reduced form, where x, y, z are pairwise coprime.



Then, assume that there is equality in (I) $ x^3+y^3= z^3 $ for some positive integers x, y, z . The expression $zover{x+y}$ is a rational number. Whether $zover{x+y}$ is reduced or not is unknown.



A. In the case that $zover{x+y}$ is reduced $Rightarrow$ z and x+y are coprime. Let ${zover{x+y}}={rover s}$, where $rover s$ is reduced $Rightarrow$ r and s are coprime $Rightarrow$ $sqrt[3]{z^3over(x+y)^3}={rover s}$ ; ${z^3over(x+y)^3}={r^3over s^3}$



Since both sides of ${zover{x+y}}={rover s}$ are reduced $Rightarrow$
$s^3=(x+y)^3 $ and $r^3=z^3$. Insert (I) $Rightarrow$ $r^3= x^3+y^3=(x+y)(x^2-xy+y^2)$. But then $r^3$ and $s^3$ have a common factor $x+y$ $Rightarrow$ $r$ and $s$ have a common factor $Rightarrow$ contradiction $Rightarrow$ $zover{x+y}$ is
irrational $Rightarrow$ at least one of x,y,z is irrational $Rightarrow$
$x^3+y^3neq z^3$.



B. In the case that $zover{x+y}$ is not reduced $Rightarrow$ z and x+y have
a common factor k $Rightarrow$
$ {rover s}={{z/k}over{(x+y)/k}}$ . Let ${rover s}=sqrt[3] {{(z/k)^3}over{((x+y)/k)^3}}$;
${r^3over s^3}={{(z/k)^3}over{((x+y)/k)^3}}$ ; both sides of ${rover s}={{z/k}over{(x+y)/k}}$ are reduced $Rightarrow$
$s^3={{x+y}over k^3} $ and and $r^3={z^3over k^3}$. Insert (I) $Rightarrow$ $r^3={{x^3+y^3}over k^3}$ = ${{(x+y)(x^2-xy+y^2)}over k^3}$.



B1. $k$ but not $k^2$or $k^3$ divides $x+y$.



What seems to be a shared common factor between $s^3$ and $r^3$ is ${x+y}over k$, which is an integer, so there seems to be a contradiction. Since $r^3$ is an integer,${{x^2-xy+y^2}over k^2}$ should be an integer. But
$x^2-xy+y^2$ is coprime to $x+y$ (*See below) and is not divisible by $k^2$ (**See below) $Rightarrow$ ${{x^2-xy+y^2}over k^2}$ is not an integer $Rightarrow$ $r^3={z^3over k^3}$ is an integer, but $r^3={{x^3+y^3}over k^3}$ is not an integer. That is a contradiction $Rightarrow$
$x^3+y^3neq z^3$



B2. $k^3$ divides $x+y$ $Rightarrow$ $x^2-xy+y^2$ is an integer.



$r^3$ $={{x+y}over k^3}cdot {(x^2-xy+y^2)}$and ${s^3={{x+y}over k^3}}{cdot(x+y)^2}$ $Rightarrow$ $r^3$ and $s^3$ have a common factor ${{x+y}over k^3}$ $Rightarrow$ r and s have a common factor. That is a contradiction $Rightarrow$ $zover{x+y}$ is irrational $Rightarrow$ at least one of x,y,z is irrational $Rightarrow$$x^3+y^3neq z^3$.



B3. $k^2$ but not $k^3$ divides $x+y$. $Rightarrow$ $r^3$ $={{x+y}over k^2}cdot {{x^2-xy+y^2}over k}$ and $s^3={(x+y)over k^2}{cdot(x+y)^2over k}$. If $k=3$, $x^2-xy+y^2$ can be divided by 3 and the common factor is ${{x+y}over k^2}$ $Rightarrow$ contradiction like in B2.



If $kneq 3$ $Rightarrow$ $x^2-xy+y^2$ is not divided by $k$. $x^2-xy+y^2$ is not an integer.There is a contradiction the same way as in B1$Rightarrow$ $x^3+y^3neq z^3$.



Fermat´s last theorem is true for n=3.



*According to the conditions, x is coprime to y $Rightarrow$ x and y both are coprime to x+y. Also, $x+y$ and $x^2-xy+y^2=(x+y)^2-3xy$ have no common factors (if 3 is not the common factor, see **). If the differens ${(x+y)^2-3xy}$ had a factor in common with one of the terms $Rightarrow$ the other term would have the same factor. There is also a theorem which could be used. see this link:
If $n$ is an odd prime, and $a$ and $b$ are co-prime, and $a+b$ is not a multiple of $n$, prove that $frac{a^n+b^n}{a+b}$ is co-prime to $a+b$.



**If 3 divides x+y, then 3 does not divide x or y $Rightarrow$ $x^2-xy+y^2=(x+y)^2-3xy$ has at most one factor =3, since the expression is limited by the term $3xy$ which has only one factor 3 $Rightarrow$ $x+y$ and $x^2-xy+y^2$ have no common factors , if 3 is not the common factor $Rightarrow$ $x^2-xy+y^2$can not be divided by k, if $kneq3$. If k=3, $x^2-xy+y^2$ can be divided by 3 but not by $k^2=9$ $Rightarrow$ ${x^2-xy+y^2}over k^2$ is not an integer.










share|cite|improve this question















According to Fermat´s last theorem, equality in $ x^n+y^n= z^n $ is not possible for positive integers x, y, z, n if n≥3 .



Following proof for n=3 is based upon the assumption that there is equality and that this assumption leads to contradiction. The assumption that there is equality in (I) $ x^3+y^3= z^3 $ for some positive integers x, y, z is combined with (II) ${zover{x+y}}=sqrt[3]{z^3over(x+y)^3}$. The combination leads to contradiction and shows that $ {zover {x+y}}$ is irrational, then at least one of x,y,z is irrational and $x^3+y^3neq z^3$.



Assume that $ x^3+y^3= z^3 $ is in its reduced form, where x, y, z are pairwise coprime.



Then, assume that there is equality in (I) $ x^3+y^3= z^3 $ for some positive integers x, y, z . The expression $zover{x+y}$ is a rational number. Whether $zover{x+y}$ is reduced or not is unknown.



A. In the case that $zover{x+y}$ is reduced $Rightarrow$ z and x+y are coprime. Let ${zover{x+y}}={rover s}$, where $rover s$ is reduced $Rightarrow$ r and s are coprime $Rightarrow$ $sqrt[3]{z^3over(x+y)^3}={rover s}$ ; ${z^3over(x+y)^3}={r^3over s^3}$



Since both sides of ${zover{x+y}}={rover s}$ are reduced $Rightarrow$
$s^3=(x+y)^3 $ and $r^3=z^3$. Insert (I) $Rightarrow$ $r^3= x^3+y^3=(x+y)(x^2-xy+y^2)$. But then $r^3$ and $s^3$ have a common factor $x+y$ $Rightarrow$ $r$ and $s$ have a common factor $Rightarrow$ contradiction $Rightarrow$ $zover{x+y}$ is
irrational $Rightarrow$ at least one of x,y,z is irrational $Rightarrow$
$x^3+y^3neq z^3$.



B. In the case that $zover{x+y}$ is not reduced $Rightarrow$ z and x+y have
a common factor k $Rightarrow$
$ {rover s}={{z/k}over{(x+y)/k}}$ . Let ${rover s}=sqrt[3] {{(z/k)^3}over{((x+y)/k)^3}}$;
${r^3over s^3}={{(z/k)^3}over{((x+y)/k)^3}}$ ; both sides of ${rover s}={{z/k}over{(x+y)/k}}$ are reduced $Rightarrow$
$s^3={{x+y}over k^3} $ and and $r^3={z^3over k^3}$. Insert (I) $Rightarrow$ $r^3={{x^3+y^3}over k^3}$ = ${{(x+y)(x^2-xy+y^2)}over k^3}$.



B1. $k$ but not $k^2$or $k^3$ divides $x+y$.



What seems to be a shared common factor between $s^3$ and $r^3$ is ${x+y}over k$, which is an integer, so there seems to be a contradiction. Since $r^3$ is an integer,${{x^2-xy+y^2}over k^2}$ should be an integer. But
$x^2-xy+y^2$ is coprime to $x+y$ (*See below) and is not divisible by $k^2$ (**See below) $Rightarrow$ ${{x^2-xy+y^2}over k^2}$ is not an integer $Rightarrow$ $r^3={z^3over k^3}$ is an integer, but $r^3={{x^3+y^3}over k^3}$ is not an integer. That is a contradiction $Rightarrow$
$x^3+y^3neq z^3$



B2. $k^3$ divides $x+y$ $Rightarrow$ $x^2-xy+y^2$ is an integer.



$r^3$ $={{x+y}over k^3}cdot {(x^2-xy+y^2)}$and ${s^3={{x+y}over k^3}}{cdot(x+y)^2}$ $Rightarrow$ $r^3$ and $s^3$ have a common factor ${{x+y}over k^3}$ $Rightarrow$ r and s have a common factor. That is a contradiction $Rightarrow$ $zover{x+y}$ is irrational $Rightarrow$ at least one of x,y,z is irrational $Rightarrow$$x^3+y^3neq z^3$.



B3. $k^2$ but not $k^3$ divides $x+y$. $Rightarrow$ $r^3$ $={{x+y}over k^2}cdot {{x^2-xy+y^2}over k}$ and $s^3={(x+y)over k^2}{cdot(x+y)^2over k}$. If $k=3$, $x^2-xy+y^2$ can be divided by 3 and the common factor is ${{x+y}over k^2}$ $Rightarrow$ contradiction like in B2.



If $kneq 3$ $Rightarrow$ $x^2-xy+y^2$ is not divided by $k$. $x^2-xy+y^2$ is not an integer.There is a contradiction the same way as in B1$Rightarrow$ $x^3+y^3neq z^3$.



Fermat´s last theorem is true for n=3.



*According to the conditions, x is coprime to y $Rightarrow$ x and y both are coprime to x+y. Also, $x+y$ and $x^2-xy+y^2=(x+y)^2-3xy$ have no common factors (if 3 is not the common factor, see **). If the differens ${(x+y)^2-3xy}$ had a factor in common with one of the terms $Rightarrow$ the other term would have the same factor. There is also a theorem which could be used. see this link:
If $n$ is an odd prime, and $a$ and $b$ are co-prime, and $a+b$ is not a multiple of $n$, prove that $frac{a^n+b^n}{a+b}$ is co-prime to $a+b$.



**If 3 divides x+y, then 3 does not divide x or y $Rightarrow$ $x^2-xy+y^2=(x+y)^2-3xy$ has at most one factor =3, since the expression is limited by the term $3xy$ which has only one factor 3 $Rightarrow$ $x+y$ and $x^2-xy+y^2$ have no common factors , if 3 is not the common factor $Rightarrow$ $x^2-xy+y^2$can not be divided by k, if $kneq3$. If k=3, $x^2-xy+y^2$ can be divided by 3 but not by $k^2=9$ $Rightarrow$ ${x^2-xy+y^2}over k^2$ is not an integer.







proof-verification






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 2 days ago

























asked Dec 20 at 17:13









Ylvali

243




243








  • 2




    Honestly, I'm too lazy to read through all of this, but I wouldn't be surprised if it were mostly accurate. The proof for $n=3$ is not that difficult.
    – Don Thousand
    Dec 20 at 17:16






  • 1




    See this
    – Don Thousand
    Dec 20 at 17:17






  • 2




    I don't think this is the correct place to ask for the correctness of such a long proof. Also, if you are interested, you can find a proof on Wikipedia (specific cases of FLT have been known for centuries).
    – user1729
    Dec 20 at 17:17










  • Thanks for comments.I now have edited and shortened it as much as possible, trying to make it easier to follow,and the math is really simple.I was hoping that if there is a serious flaw, someone could discover it.And I know of other proofs, but the links added some.
    – Ylvali
    Dec 23 at 22:28














  • 2




    Honestly, I'm too lazy to read through all of this, but I wouldn't be surprised if it were mostly accurate. The proof for $n=3$ is not that difficult.
    – Don Thousand
    Dec 20 at 17:16






  • 1




    See this
    – Don Thousand
    Dec 20 at 17:17






  • 2




    I don't think this is the correct place to ask for the correctness of such a long proof. Also, if you are interested, you can find a proof on Wikipedia (specific cases of FLT have been known for centuries).
    – user1729
    Dec 20 at 17:17










  • Thanks for comments.I now have edited and shortened it as much as possible, trying to make it easier to follow,and the math is really simple.I was hoping that if there is a serious flaw, someone could discover it.And I know of other proofs, but the links added some.
    – Ylvali
    Dec 23 at 22:28








2




2




Honestly, I'm too lazy to read through all of this, but I wouldn't be surprised if it were mostly accurate. The proof for $n=3$ is not that difficult.
– Don Thousand
Dec 20 at 17:16




Honestly, I'm too lazy to read through all of this, but I wouldn't be surprised if it were mostly accurate. The proof for $n=3$ is not that difficult.
– Don Thousand
Dec 20 at 17:16




1




1




See this
– Don Thousand
Dec 20 at 17:17




See this
– Don Thousand
Dec 20 at 17:17




2




2




I don't think this is the correct place to ask for the correctness of such a long proof. Also, if you are interested, you can find a proof on Wikipedia (specific cases of FLT have been known for centuries).
– user1729
Dec 20 at 17:17




I don't think this is the correct place to ask for the correctness of such a long proof. Also, if you are interested, you can find a proof on Wikipedia (specific cases of FLT have been known for centuries).
– user1729
Dec 20 at 17:17












Thanks for comments.I now have edited and shortened it as much as possible, trying to make it easier to follow,and the math is really simple.I was hoping that if there is a serious flaw, someone could discover it.And I know of other proofs, but the links added some.
– Ylvali
Dec 23 at 22:28




Thanks for comments.I now have edited and shortened it as much as possible, trying to make it easier to follow,and the math is really simple.I was hoping that if there is a serious flaw, someone could discover it.And I know of other proofs, but the links added some.
– Ylvali
Dec 23 at 22:28















active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3047767%2fis-something-wrong-in-this-simple-proof-of-flt-for-n-3%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3047767%2fis-something-wrong-in-this-simple-proof-of-flt-for-n-3%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Human spaceflight

Can not write log (Is /dev/pts mounted?) - openpty in Ubuntu-on-Windows?

File:DeusFollowingSea.jpg