±Û¾´ÀÌ: leejaeyu (leejaeyu)
³¯ Â¥: Fri Oct 28 00:35:07 2005
Á¦ ¸ñ: Pythagoras FLT 4 color problem proof

leejaeyul5@yahoo.co.kr http://blog.empas.com/leejaeyul5
ÀÌÀçÀ²(02-882-0830)
[¿ÏÀüÇÑ ÇÇŸ°í¶ó½º ¼ö °ø½ÄÀ» ¹ß°ßÄ¡ ¸øÇÏ¿©, ºÒ¿ÏÀüÇÑ °ø½ÄµéÀ» »ç¿ë ÁßÀ̰í,
Æä¸£¸¶ Á¤¸®¸¦ Áõ¸íÄ¡ ¸øÇÏ¿©, 170 ÂÊ ¹æ´ë ³­ÇØÇÑ ºñÀÏ¹Ý ÃßÃø Áõ¸í»ÓÀ̸ç,
4»ö¹®Á¦¸¦ Áõ¸íÄ¡ ¸øÇÏ¿©, Àΰ£³í¸® ¾Æ´Ñ, ÄÄÇ»ÅÍ ÀÇÁ¸ ¹ÌÈ®ÀÎ Áõ¸í»ÓÀÔ´Ï´Ù.
º»Àΰú ÇùÁ¶ÀÎ µéÀº ¿À·£ ¿¬±¸ ³ë·ÂÀ¸·Î, À̵鿡 ´ëÇÑ °£¸íÇÑ Áõ¸íÀ» ¹ß°ßÇϰí,
ÀÌ ³í¹®µéÀ» Á¤ºÎ ±³À° Çа迡 Á¦¾ÈÇϰí ÀÖ½À´Ï´Ù.]
1. Pythagoras FLT proof :
ÇÇŸ°í¶ó½º´Â 2580 ³â, Æä¸£¸¶´Â 400 ³â Àü¿¡ Ãâ»ý ÇÏ¿´½À´Ï´Ù. ¾Æ¸¶Ã߾À¸³ª ÈǸ¢
ÇÑ ¼öÇÐÀÚ·Î ÀÎÁ¤¹Þ´Â Æä¸£¸¶´Â, °æÀ̷οî Áõ¸í ¹ß°ß »ç½ÇÀ» ºÐ¸íÈ÷ ±â·ÏÇÏ¿© µÎ¾ú½À
´Ï´Ù. ´ë´Ù¼öÀÇ Çö´ë ¼öÇÐÀÚµéÀÌ ±×¸¦ ¹ÏÁö ¾Ê°í ÀÖ¾úÀ¸³ª, ¿ì¸®´Â ¸¹Àº ¼öÇÐ ¾÷ÀûÀ»
³²±ä ³í¸® Á¤¿¬ÇÑ »ç¶÷ÀÌ ±â·ÏÀ¸·Î ³²±ä ¸¸Å­, ±×°¡ ¸íÈ®ÇÏ°Ô Áõ¸íÇÏ¿´´Ù°í ¹Ï´Â °Í
ÀÔ´Ï´Ù.
X^n+Y^n=Z^n
{X^(n/2)}^2+{Y^(n/2)}^2={Z^(n/2)}^2
A=Z^(n/2)-Y^(n/2), B=Z^(n/2)-X^(n/2)
X^(n/2)=(2AB)^1/2+A, Y^(n/2)=(2AB)^1/2+B, Z^(n/2)=(2AB)^1/2+A+B
X^(n/2)Y^(n/2)=3AB+(A+B)(2AB)^1/2
(XY)^n=2A^3B+2AB^3+13(AB)^2+6AB(A+B)(2AB)^1/2
Æä¸£¸¶´Â »ó±â¿Í °°Àº ½ÄÀ¸·Î Áõ¸íÇÏ¿´À» °ÍÀÔ´Ï´Ù. ¿ì¸®´Â À̸¦ º¸´Ù ´õ ºÐ¸íÇÑ ÇØ
¼®À¸·Î Áõ¸íÇÏ¿© Á¦½ÃÇÑ °ÍÀÔ´Ï´Ù.
2. 4 color problem proof :
¿ì¸®ÀÇ 4»ö ¹®Á¦ Áõ¸íÀº ¿¬¿ª ³í¸®ÀûÀÎ Áõ¸íÀÔ´Ï´Ù.
¸ðµç ³ª¶óµéÀÌ ÀÓÀÇÀÇ ÇÑ Á¡¿¡ Á¢Çϵµ·Ï ±×·Á º¸¸é, ÀÌ ³ª¶óµéÀÌ 3°¡Áö ÀÌÇÏÀÇ »öÀ¸
·Î ÃæºÐÇÏ°Ô ±¸ºÐÀÌ µÊÀ¸·Î¼­, 4»ö ¹®Á¦°¡ Áõ¸íÀÌ µÉ ¼ö ÀÖ´Â °ÍÀÔ´Ï´Ù.
ÇÑ Á¡À» °øÀ¯ÇÏ´Â ¸ðµç ³ª¶ó°¡ 3»öÀ¸·Î ±¸ºÐµÊÀ¸·Î, ÇÑ ³ª¶óÀÇ ±¹°æ¼± ÀϺθ¦ °øÀ¯ÇÏ
´Â ÁÖº¯ÀÇ ¸ðµç ³ª¶óµéµµ ¿ª½Ã 3»öÀ¸·Î ÃæºÐÇÏ°Ô ±¸ºÐµÉ ¼ö°¡ Àֱ⠶§¹®ÀÔ´Ï´Ù.
3. ¿ì¸® ³í¹®ÀÇ Ã·ºÎ ÆÄÀÏÀº ÀÌÀçÀ²-¿¥ÆÄ½ºÄ«Æä, ´ÙÀ½Ä«Æä, ¾ßÈÄŬ·´, ³×À̹öºí·Î±×
, ³×À̹öÄ«Æä, ÇÁ¸®Ã¿¼¶°ú ´ëÇѼöÇÐȸ ÀÚÀ¯Åä·Ð¹æ µî¿¡µµ ÀÖ½À´Ï´Ù.
Pythagorean Numbers and Fermat's Last Theorem Proof
Preface
Here is the equation X^n+Y^n=Z^n. When n=2, the equation becomes X^2+Y^2=Z^2.

The Pythagorean Theorem and the Pythagorean Numbers have been well known thing
s.
The numbers of X, Y, Z and n are non zero integers. But anybody had not analys
ed
the imperfect forms about the Pythagorean Numbers carefully. When n be greater
or
equal 3, the equation can never have non zero integer solutions. The fact was
also
well known as the Fermat's Last Theorem. The Fermat had written that he found
out
the proof and the proof was beautiful and wonderful thing. But anybody could n
ot find
out his proof, so nobody could know his proof. We have considered A=Z-Y, B=Z-X

in the equation. We found out one new perfect form about the Pythagorean Numbe
rs,
and a new simple and plain proof about the Fermat's Last Theorem.
Key Words and Phrases
MSC : 11-A99 Number Theory
Y+A=X+B=Z. X-A=Y-B=Z-A-B. G=(X-A)/(AB)^(1/n)=(Y-B)/(AB)^(1/n)=(Z-A-B)/(AB)^(1/
n)
X=G(AB)^(1/n)+A. Y=G(AB)^(1/n)+B. Z=G(AB)^(1/n)+A+B
{G(AB)^(1/n)+A}^n+{G(AB)^(1/n)+B}^n={G(AB)^(1/n)+A+B}^n
G(A,B)^(1/n)=q[{2^(n-1)/n+¡¦+2^(2/n)+2^(1/n)}/2][{A^(n-1)B}^(1/n)+{AB^(n-1)}^(
1/n)]
Sentence
Here
the numbers of X, Y, Z and n are non zero integers.
X^n+Y^n=Z^n
And the numbers of A, B are not 0.
Y+A=X+B=Z
Therefore
X-A=Y-B=Z-A-B
And
(X-A)/(AB)^(1/n)=(Y-B)/(AB)^(1/n)=(Z-A-B)/(AB)^(1/n)
This be G.
G=(X-A)/(AB)^(1/n)=(Y-B)/(AB)^(1/n)=(Z-A-B)/(AB)^(1/n)
So
X=G(AB)^(1/n)+A, Y=G(AB)^(1/n)+B, Z=G(AB)^(1/n)+A+B
Therefore
{G(AB)^(1/n)+A}^n+{G(AB)^(1/n)+B}^n={G(AB)^(1/n)+A+B}^n
350 years ago,
the Fermat wrote that the proof was beautiful and wonderful thing.
We believe that the Fermat had found out the form.
In
{G(AB)^(1/n)+A}^n+{G(AB)^(1/n)+B}^n={G(AB)^(1/n)+A+B}^n
when n=1, G=0
when n=2, G=2^(1/2)
when n=3, G=F(A,B)
So
When n=1
G=0, G(AB)^(1/n)=0
and
A+B=A+B
X=A, Y=B, Z=A+B
When n=2
G=2^(1/2), G(AB)^(1/n)=(2AB)^(1/2)
and
{(2AB)^(1/2)+A}^2+{(2AB)^(1/2)+B}^2={(2AB)^(1/2)+A+B}^2
X=(2AB)^(1/2)+A, Y=(2AB)^(1/2)+B, Z=(2AB)^(1/2)+A+B
These
were 3 imperfect forms about the Pythagorean Numbers.
First
X=2A+1, Y=2A^2+2A, Z=2A^2+2A+1
Second
X=4A, Y=4A^2-1, Z=4A^2+1
Third
X=A^2-B^2, Y=2AB, Z=A^2+B^2
This
be one new perfect form about the Pythagorean Numbers.
X=(2AB)^(1/2)+A, Y=(2AB)^(1/2)+B, Z=(2AB)^(1/2)+A+B
When
n be greater or equal 3
G=F(A,B)
So
X=G(AB)^(1/n)+A, Y=G(AB)^(1/n)+B, Z=G(AB)^(1/n)+A+B
{G(AB)^(1/n)+A}^n+{G(AB)^(1/n)+B}^n={G(AB)^(1/n)+A+B}^n
When
A=B
2{G+A^(n-2)/n}^n={G+2A^(n-2)/n}^n
(n-1) each G have the non positive irrational numbers
and one each G has the positive irrational numbers.
This
be the positive irrational numbers G.
G={2^(n-1)/n+¡¦+2^(2/n)+2^(1/n)}A^(n-2)/n
Here
G=F(A,B)
q=2F(A,B)/{2^(n-1)/n+¡¦+2^(2/n)+2^(1/n)}{A^(n-2)/n+B^(n-2)/n}
G=q[{2^(n-1)/n+¡¦+2^(2/n)+2^(1/n)}/2]{A^(n-2)/n+B^(n-2)/n}
And
when A=B, q must become 1.
So
G(A,B)^(1/n)=q[{2^(n-1)/n+¡¦+2^(2/n)+2^(1/n)}/2][{A^(n-1)B}^(1/n)+{AB^(n-1)}^(
1/n)]
X=q[{2^(n-1)/n+¡¦+2^(2/n)+2^(1/n)}/2][{A^(n-1)B}^(1/n)+{AB^(n-1)}^(1/n)]+A
Y=q[{2^(n-1)/n+¡¦+2^(2/n)+2^(1/n)}/2][{A^(n-1)B}^(1/n)+{AB^(n-1)}^(1/n)]+B
Z=q[{2^(n-1)/n+¡¦+2^(2/n)+2^(1/n)}/2][{A^(n-1)B}^(1/n)+{AB^(n-1)}^(1/n)]+A+B
If
the numbers of X, Y, Z be non zero integers,
the numbers of A, B must be non zero integers also.
But
in all the non zero integers A, B
G(A,B)^(1/n)=q[{2^(n-1)/n+¡¦+2^(2/n)+2^(1/n)}/2][{A^(n-1)B}^(1/n)+{AB^(n-1)}^(
1/n)]
must be the irrational numbers,
and the numbers of X, Y, Z be the irrational numbers also.
That
be an apparent contradiction.
Therefore
the numbers of X, Y, Z can not be non zero integers.
And if
the numbers of X, Y, Z be non zero integers
by the non positive irrational numbers G,
then the non zero integers A, B must be existence also.
And the positive irrational numbers G must be existence also.
And
the numbers of X, Y, Z must be the irrational numbers also
by all the non zero integers A, B and the positive irrational numbers G.
That
be an apparent contradiction.
So
When n be greater or equal 3,
the numbers of X, Y, Z can not be non zero integers
by the non positive irrational numbers G.
Therefore
In
X^n+Y^n=Z^n
and in
the non zero integers n,
when n=1
X=A, Y=B, Z=A+B
when n=2
X=(2AB)^(1/2)+A, Y=(2AB)^(1/2)+B, Z=(2AB)^(1/2)+A+B
the numbers of X, Y, Z can become non zero integers.
But
when n be greater or equal 3,
the numbers of X, Y, Z can not become non zero integers.
End

¹øÀ¸·Î     óÀ½±Û¸¶Áö¸·±Û

ÀÌÀü ±Û ´ÙÀ½ ±Û ¸ñ·Ï È­¸é º¸µå ¸ñ·Ï