صورت کوتاهی از اثبات آخرین قضیه فرما: - تالار گفتمان آذر فروم





دعوت به همکاری با آذر فروم

 

صورت کوتاهی از اثبات آخرین قضیه فرما:
زمان کنونی: 21-09-1395،09:52 ق.ظ
کاربران در حال بازدید این موضوع: 1 مهمان
نویسنده: DIRECTOR
آخرین ارسال: DIRECTOR
پاسخ: 1
بازدید: 684

 
 
رتبه موضوع:
  • 0 رای - 0 میانگین
  • 1
  • 2
  • 3
  • 4
  • 5

موضوع: صورت کوتاهی از اثبات آخرین قضیه فرما:
ارسال: #1
صورت کوتاهی از اثبات آخرین قضیه فرما:
پست‌ها: 602
تاریخ عضویت: 25 آبان 1390
اعتبار: 99
حالت من: انتخاب نشده
Fermat's Last Theorem

DOWNLOAD Mathematica Notebook EXPLORE THIS TOPIC IN the MathWorld Classroom Contribute to this entry

Fermat's last theorem is a theorem first proposed by Fermat in the form of a note scribbled in the margin of his copy of the ancient Greek text Arithmetica by Diophantus. The scribbled note was discovered posthumously, and the original is now lost. However, a copy was preserved in a book published by Fermat's son. In the note, Fermat claimed to have discovered a proof that the Diophantine equation x^n+y^n=z^n has no integer solutions for n>2 and x,y,z!=0.

The full text of Fermat's statement, written in Latin, reads "Cubum autem in duos cubos, aut quadrato-quadratum in duos quadrato-quadratos, et generaliter nullam in infinitum ultra quadratum potestatem in duos eiusdem nominis fas est dividere cuius rei demonstrationem mirabilem sane detexi. Hanc marginis exiguitas non caperet" (Nagell 1951, p. 252). In translation, "It is impossible for a cube to be the sum of two cubes, a fourth power to be the sum of two fourth powers, or in general for any number that is a power greater than the second to be the sum of two like powers. I have discovered a truly marvelous demonstration of this proposition that this margin is too narrow to contain."

As a result of Fermat's marginal note, the proposition that the Diophantine equation
x^n+y^n=z^n,
(1)

where x, y, z, and n are integers, has no nonzero solutions for n>2 has come to be known as Fermat's Last Theorem. It was called a "theorem" on the strength of Fermat's statement, despite the fact that no other mathematician was able to prove it for hundreds of years.

Note that the restriction n>2 is obviously necessary since there are a number of elementary formulas for generating an infinite number of Pythagorean triples (x,y,z) satisfying the equation for n=2,
x^2+y^2=z^2.
(2)

A first attempt to solve the equation can be made by attempting to factor the equation, giving
(z^(n/2)+y^(n/2))(z^(n/2)-y^(n/2))=x^n.
(3)

Since the product is an exact power,
{z^(n/2)+y^(n/2)=2^(n-1)p^n; z^(n/2)-y^(n/2)=2q^nor{z^(n/2)+y^(n/2)=2p^n; z^(n/2)-y^(n/2)=2^(n-1)q^n.
(4)

Solving for y and z gives
{z^(n/2)=2^(n-2)p^n+q^n; y^(n/2)=2^(n-2)p^n-q^nor{z^(n/2)=p^n+2^(n-2)q^n; y^(n/2)=p^n-2^(n-2)q^n,
(5)

which give
{z=(2^(n-2)p^n+q^n)^(2/n); y=(2^(n-2)p^n-q^n)^(2/n)or{z=(p^n+2^(n-2)q^n)^(2/n); y=(p^n-2^(n-2)q^n)^(2/n).
(6)

However, since solutions to these equations in rational numbers are no easier to find than solutions to the original equation, this approach unfortunately does not provide any additional insight.

If an odd prime p divides n, then the reduction
(x^m)^p+(y^m)^p=(z^m)^p
(7)

can be made, so redefining the arguments gives
x^p+y^p=z^p.
(8)

If no odd prime divides n, then n is a power of 2, so 4|n and, in this case, equations (7) and (8) work with 4 in place of p. Since the case n=4 was proved by Fermat to have no solutions, it is sufficient to prove Fermat's last theorem by considering odd prime powers only.

Similarly, is sufficient to prove Fermat's last theorem by considering only relatively prime x, y, and z, since each term in equation (1) can then be divided by GCD(x,y,z)^n, where GCD(x,y,z) is the greatest common divisor.

The so-called "first case" of the theorem is for exponents which are relatively prime to x, y, and z (px,y,z) and was considered by Wieferich. Sophie Germain proved the first case of Fermat's Last Theorem for any odd prime p when 2p+1 is also a prime. Legendre subsequently proved that if p is a prime such that 4p+1, 8p+1, 10p+1, 14p+1, or 16p+1 is also a prime, then the first case of Fermat's Last Theorem holds for p. This established Fermat's Last Theorem for p<100. In 1849, Kummer proved it for all regular primes and composite numbers of which they are factors (Vandiver 1929, Ball and Coxeter 1987).

The "second case" of Fermat's last theorem is "p divides exactly one of x, y, z. Note that p|x,y,z is ruled out by x, y, z being relatively prime, and that if p divides two of x, y, z, then it also divides the third, by equation (8).

Kummer's attack led to the theory of ideals, and Vandiver developed Vandiver's criteria for deciding if a given irregular prime satisfies the theorem. In 1852, Genocchi proved that the first case is true for p if (p,p-3) is not an irregular pair. In 1858, Kummer showed that the first case is true if either (p,p-3) or (p,p-5) is an irregular pair, which was subsequently extended to include (p,p-7) and (p,p-9) by Mirimanoff (1909). Vandiver (1920ab) pointed out gaps and errors in Kummer's memoir which, in his view, invalidate Kummer's proof of Fermat's Last Theorem for the irregular primes 37, 59, and 67, although he claims Mirimanoff's proof of FLT for exponent 37 is still valid.

Wieferich (1909) proved that if the equation is solved in integers relatively prime to an odd prime p, then
2^(p-1)=1 (mod p^2).
(9)

(Ball and Coxeter 1987). Such numbers are called Wieferich primes. Mirimanoff (1909) subsequently showed that
3^(p-1)=1 (mod p^2)
(10)

must also hold for solutions relatively prime to an odd prime p, which excludes the first two Wieferich primes 1093 and 3511. In 1914, Vandiver showed
5^(p-1)=1 (mod p^2),
(11)

and Frobenius extended this to
11^(p-1),17^(p-1)=1 (mod p^2).
(12)

It has also been shown that if p were a prime of the form 6x-1, then
7^(p-1),13^(p-1),19^(p-1)=1 (mod p^2),
(13)

which raised the smallest possible p in the "first case" to 253747889 by 1941 (Rosser 1941). Granville and Monagan (1988) showed if there exists a prime p satisfying Fermat's Last Theorem, then
q^(p-1)=1 (mod p^2)
(14)

for q=5, 7, 11, ..., 71. This establishes that the first case is true for all prime exponents up to 714591416091398 (Vardi 1991).

The "second case" of Fermat's Last Theorem (for p|x,y,z) proved harder than the first case.

Euler proved the general case of the theorem for n=3, Fermat n=4, Dirichlet and Lagrange n=5. In 1832, Dirichlet established the case n=14. The n=7 case was proved by Lamé (1839; Wells 1986, p. 70), using the identity
(X+Y+Z)^7-(X^7+Y^7+Z^7)=7(X+Y)(X+Z)(Y+Z) ×[(X^2+Y^2+Z^2+XY+XZ+YZ)^2+XYZ(X+Y+Z)].
(15)

Although some errors were present in this proof, these were subsequently fixed by Lebesgue in 1840. Much additional progress was made over the next 150 years, but no completely general result had been obtained. Buoyed by false confidence after his proof that pi is transcendental, the mathematician Lindemann proceeded to publish several proofs of Fermat's Last Theorem, all of them invalid (Bell 1937, pp. 464-465). A prize of 100000 German marks, known as the Wolfskehl Prize, was also offered for the first valid proof (Ball and Coxeter 1987, p. 72; Barner 1997; Hoffman 1998, pp. 193-194 and 199).

A recent false alarm for a general proof was raised by Y. Miyaoka (Cipra 1988) whose proof, however, turned out to be flawed. Other attempted proofs among both professional and amateur mathematicians are discussed by vos Savant (1993), although vos Savant erroneously claims that work on the problem by Wiles (discussed below) is invalid. By the time 1993 rolled around, the general case of Fermat's Last Theorem had been shown to be true for all exponents up to 4×10^6 (Cipra 1993). However, given that a proof of Fermat's Last Theorem requires truth for all exponents, proof for any finite number of exponents does not constitute any significant progress towards a proof of the general theorem (although the fact that no counterexamples were found for this many cases is highly suggestive).

In 1993, a bombshell was dropped. In that year, the general theorem was partially proven by Andrew Wiles (Cipra 1993, Stewart 1993) by proving the semistable case of the Taniyama-Shimura conjecture. Unfortunately, several holes were discovered in the proof shortly thereafter when Wiles' approach via the Taniyama-Shimura conjecture became hung up on properties of the Selmer group using a tool called an Euler system. However, the difficulty was circumvented by Wiles and R. Taylor in late 1994 (Cipra 1994, 1995) and published in Taylor and Wiles (1995) and Wiles (1995). Wiles' proof succeeds by (1) replacing elliptic curves with Galois representations, (2) reducing the problem to a class number formula, (3) proving that formula, and (4) tying up loose ends that arise because the formalisms fail in the simplest degenerate cases (Cipra 1995).

The proof of Fermat's Last Theorem marks the end of a mathematical era. Since virtually all of the tools which were eventually brought to bear on the problem had yet to be invented in the time of Fermat, it is interesting to speculate about whether he actually was in possession of an elementary proof of the theorem. Judging by the tenacity with which the problem resisted attack for so long, Fermat's alleged proof seems likely to have been illusionary. This conclusion is further supported by the fact that Fermat searched for proofs for the cases n=4 and n=5, which would have been superfluous had he actually been in possession of a general proof.

In the Homer^3 episode of the television program The Simpsons, the equation 1782^(12)+1841^(12)=1922^(12) appeared at one point in the background. Expansion reveals that only the first 9 decimal digits match (Rogers 2005). The episode The Wizard of Evergreen Terrace mentions 3987^(12)+4365^(12)=4472^(12), which matches not only in the first 10 decimal places but also the easy-to-check last place (Greenwald). At the start of Star Trek: The Next Generation episode "The Royale," Captain Picard mentions that studying Fermat's Last Theorem is a relaxing process.
















اگر میخواهی دروغی نشنوی ، اصراری برای شنیدن حقیقت مکن . . .
07-11-1390 02:35 ق.ظ
 


[-]
پاسخ سریع
پیام
پاسخ خود را برای این پیام در اینجا بنویسید.


کد تصویری
royalfuns
(غیر حساس به بزرگی و کوچکی حروف)
لطفاً کد نشان داده شده در تصویر را وارد نمایید. این اقدام جهت جلوگیری از ارسال‌های خودکار ضروری می‌باشد.

موضوعات مشابه ...
موضوع: نویسنده پاسخ: بازدید: آخرین ارسال
21 اثبات شهودی DIRECTOR 0 261 29-07-1391 01:12 ق.ظ
آخرین ارسال: DIRECTOR
  آخرین قضییه فرما برای مکعبها: DIRECTOR 0 290 07-11-1390 02:36 ق.ظ
آخرین ارسال: DIRECTOR
  اثبات متعالی بودن دو عدد پی و e DIRECTOR 0 350 07-11-1390 02:34 ق.ظ
آخرین ارسال: DIRECTOR
  متن کامل مقاله مهم «اندرو وایلز»(سال ۱۹۹۵) در اثبات قضیه آخر فرما در ۱۰۹ صفحه (با قال DIRECTOR 0 630 07-11-1390 02:33 ق.ظ
آخرین ارسال: DIRECTOR

پرش به انجمن:


کاربران در حال بازدید این موضوع: 1 مهمان