







CTK Exchange
Victor
guest

Oct1205, 03:55 PM (EST) 

"News aboutFLT"

It is common knowledge that if the integers A and B have no common factor and A + B do not divided by simple n then the efficient (A + B) and (A^n + B^n)/(A + B) of the number A^n + B^n have no common factor. Therefore, after cancellation of common factors in the equation A^n + B^n = C^n at least two (for example A and B) from three numbers A, B, C are not divisible by n. Then each number from A^n and B^n consists of pair of the factors which have no common factor (and therefore they are nth powers!): in particular, C  B = a^n and C  A = b^n. Therefore, if the Fermat's equation exists, then there exist the Fermat's equations a^n b^n = A  B = 1^n, 2^n, 3^n, etc. Absurdity is obvious. The proof of the FLT is done. Victor


Alert  IP 
Printerfriendly page 
Reply 
Reply With Quote  Top 


mr_homm
Member since May2205

Oct1205, 04:45 PM (EST) 

1. "RE: News aboutFLT"
In response to message #0

Let me fill in the details of your argument to make sure I understand it: >It is common knowledge that if the integers A and B have no >common factor and A + B do not divided by >simple n then the efficient (A + B) and >(A^n + B^n)/(A + B) of the number >A^n + B^n have no common factor. I do not remember this fact, but I will assume it is true. Of course it is also true when you use A^nB^n and AB. There is a little trouble here, because for A^nB^n can always be divided by AB, but A^n+B^n can only be divided by AB when n is an even number. >Therefore, after cancellation of common factors in the >equation A^n + B^n = C^n at least two (for >example A and B) from three numbers A, B, C are not >divisible by n. This is clear. >Then each number from A^n and B^n consists >of pair of the factors which have no common factor (and >therefore they are nth powers!): in particular, C  B >= a^n and C  A = b^n. If I understand you correctly, this is true because A^n = C^nB^n and BC is not divisible by n. There is a trouble with this: it is possible that all of A, B, and C are not divisible by n. In that case, CB or CA or both may be accidentally divisible by n. In that case, there may be only one pair of numbers whose difference is not divisible by n, and you need two pairs for your argument. However, suppose that you do have CB and CA not divisible by n. Then the common knowledge tells you that A^n factors into two factors a_1 and a_2, which share no common factors. Therefore each of them is an nth power. One of these factors is CB, so you get CB = a^n. In the same way you get CA = b^n. Another trouble is that the numbers not divisible by n may not be CB and CA. One of them may instead be A+B, and in that case your common knowledge only works when n is even. > >Therefore, if the Fermat's equation exists, then there exist >the Fermat's equations > >a^n  b^n = A  B = 1^n, 2^n, 3^n, etc. > I do not follow this last part at all. How do you get 1^n, 2^n, 3^n, etc.? >Absurdity is obvious. The proof of the FLT is done. I think there are still some troubles you need to fix. Stuart Anderson


Alert  IP 
Printerfriendly page 
Reply 
Reply With Quote  Top 



mr_homm
Member since May2205

Oct1305, 08:11 PM (EST) 

2. "RE: News aboutFLT"
In response to message #1

Posting to correct an error: >Of course it is also true when you use A^nB^n >and AB. There is a little trouble here, >because for A^nB^n can always be divided by >AB, but A^n+B^n can only be >divided by AB when n is an even number. The last line should read "divided by A+B when n is an even number." Stuart Anderson


Alert  IP 
Printerfriendly page 
Reply 
Reply With Quote  Top 




Victor Sorokine
guest

Oct1405, 03:49 PM (EST) 

5. "RE: News aboutFLT"
In response to message #1

>>"Therefore, if the Fermat's equation exists, then there exist >>the Fermat's equations >> >>a^n  b^n = A  B = 1^n, 2^n, 3^n, etc." >> > >I do not follow this last part at all. How do you get 1^n, >2^n, 3^n, etc.? > >Stuart Anderson Answer: Let (A, B, C) is a solution of the Fermat's equation (1°), where (2°) A + B C = U, C B = a^n, C A = b^n. Let's show that (A*, B*, C*) is a solution of the equation (1°), where (3°) A* + B* C* = U, C* B* = a*^n = a^n, C* A* = a^n 1. (4°) 2U = 2A + 2B 2C = (A + B) (C B) (C A) = 2A* + 2B* 2C* = (A* + B*) (C* B*) (C* A*). (5°) So, C* B* <= a*^n = a^n> is whole (cf. 3°); (6°) therefore C* A* <= a^n 1> is whole (cf. 3°); (7°) therefore (C* B*) + (C* A*) is whole (cf. 5° and 6°); (8°) therefore A* + B* <= 2U (C* B*) + (C* A*)> is whole; (9°) therefore C* <= U B* A*> is whole (cf. 2° and 4°); (10°) therefore B* <= C* a^n> is whole (cf. 3°); (11°) therefore A* <= U B* + C*> is whole (cf. 2° and 4°). (12°) Therefore A*, B*, C* are whole and therefore: C* B* = a*^n, C* A* = b*^n = a^n 1 = a*^n 1 AND b*^n a*^n = 1 = 1^n, that is impossible!!! +++++ Lemma: If the integers A and B have no common factor and A+B do not divided by prime n then the factors (A+B) and (A^n + B^n)/(A+B) of the number A^n + B^n have no common factor. Proof: (A^n + B^n)/(A+B) = R = = A^(n1) + A^(n2) . B +
+ A^(n2)/2 . B^(n2)/2 + A . B^(n2) + B^(n1) = = + +
+ A^(n2)/2 . B^(n2) = = + + AB + +
A^(n2)/2 . B^(n2)/2 = = (A B)^2 . P + nA^(n2)/2 . B^(n2)/2. The numbers A B and nA^(n2)/2 . B^(n2)/2 have no common factor. The numbers A B and (A B)^2 . P + nA^(n2)/2 . B^(n2)/2 have no common factor. The Lemma is proven. Corollary: In the equation A^n + B^n = C^n (where A, B, C are integers and prime n > 2), minimum two equation from C B = a^n, C A = b^n, A + B = c^n are right. (Published: Journal of TRIZ, 1992, n° 3.4.92. V.M.Sorokin. Proof of the Great Fermat Theorem found with help of TRIZlike methods. Russia.) Victor Sorokine 

Alert  IP 
Printerfriendly page 
Reply 
Reply With Quote  Top 




Victor Sorokine
guest

Oct1505, 07:58 AM (EST) 

6. "RE: News aboutFLT  More clear"
In response to message #5

More clear: Let (A, B, C), where: A, B, C have no common factors, (2°) A + B  C = U, A and B and C  B  1 (or C  B + 1) are not divided by n, is an integervalued solution of the Fermat's equation A^n + B^n  C^n (1°). Let's show that (A*, B*, C*), where (3°) A* + B*  C* = U, C*  B* = C  B <= a^n> and C*  A* = C  B  1, is also an integervalued solution of the equation (1°). (4°) From (2°) we have: 2U = 2A + 2B  2C = (A + B)  (C  B)  (C  A) = = 2A* + 2B*  2C* = (A* + B*)  (C*  B*)  (C*  A*). (5°) So, C*  B* <= a*^n = a^n> is integervalued (cf. 3°); etc
(12°) Therefore A*, B*, C* are integer, where A*, B*, C*, C*  B*, C*  A* are not divided by n and they have no common factors; therefore C*  B* = a*^n, C*  A* = b*^n = a^n  1 = a*^n  1 AND b*^n  a*^n = 1 = 1^n, that is impossible!!!


Alert  IP 
Printerfriendly page 
Reply 
Reply With Quote  Top 




vsorokine
guest

Oct1505, 05:45 PM (EST) 

7. "RE:  Important insertion"
In response to message #6

Important insertion and (I hope) the finale "Let (A, B, C), where: A, B, C have no common factors, (2°) A + B C = U, A and B and C B 1 (or C B + 1) are not divided by n, is an integervalued solution of the Fermat's equation A^n + B^n C^n (1°)." insertion: Let' find a real solution (A*, B*, C*) of the equation (1°) under such conditions: (3°) A* + B* C* = U, C* B* = C B <= a^n> and C* A* = C B 1. Since the conditions are not contradictory (the determinant of the equation system (3°) =/ 0), then a real solution (A*, B*, C*) exists. Now let's show that the real numbers A*, B*, C* are integers. Farther as before


Alert  IP 
Printerfriendly page 
Reply 
Reply With Quote  Top 



ramsey2879
guest

Oct1305, 10:44 PM (EST) 

3. "RE: News aboutFLT"
In response to message #0

>It is common knowledge that if the integers A and B have no >common factor and A + B do not divided by >simple n then the efficient (A + B) and >(A^n + B^n)/(A + B) of the number >A^n + B^n have no common factor. > I believed Your proof is flawed. At best you can only show that there is no common algebraic factor. However, it is well known that two equations having no common algebraic factor are not necessarily coprime. For instance (a+b) and (a^3 + b^4) have no common algebraic factor. However, for a =3 and b=4, a+b divides a^3 + b^4!!


Alert  IP 
Printerfriendly page 
Reply 
Reply With Quote  Top 





neat_maths
Member since Aug2203

Nov1405, 08:40 AM (EST) 

8. "News aboutFLT"
In response to message #3

In this case the proposition that the two factors F1 = (A plus B) and F2 = (A^n plus B^n)/(A plus B) are mutually prime is correct and fairly easy to prove. This assumes that n is prime and that A, B, n and (A plus B) are mutually prime.If U = A plus B and V = A*B F2 can be expressed as U*(terms in U and V) plus or  n * V^((n1)/2) Therefore F2 = sum of two numbers (1st divisible by U) and (2nd not divisible by U) Therefore F2 is not divisible by U It is also fairly easy to prove that F2 and n are mutually prime (and we have already the prerequisite that n is mutually prime to F1) F2 can be expressed as U^(n1)  n * V * (terms in U and V) Therefore F2 = sum of two numbers (1st not divisible by n) and (2nd divisible by n) Therefore F2 is not divisible by n I hope that is acceptable take care 

Alert  IP 
Printerfriendly page 
Reply 
Reply With Quote  Top 




neat_maths
Member since Aug2203

Jan0206, 06:45 PM (EST) 

10. "News aboutFLT"
In response to message #3

"I believed Your proof is flawed. At best you can only show that there is no common algebraic factor. However, it is well known that two equations having no common algebraic factor are not necessarily coprime. For instance (a+b) and (a^3 + b^4) have no common algebraic factor. However, for a =3 and b=4, a+b divides a^3 + b^4!!" a^3 = 27, b^4 = 256 a^3 plus b^4 = 283 which is not divisible by 7 I don't agree with the point you are making. take care


Alert  IP 
Printerfriendly page 
Reply 
Reply With Quote  Top 



neat_maths
Member since Aug2203

Nov1605, 07:04 PM (EST) 

9. "News about FLT"
In response to message #0

<a^n b^n = A  B = 1^n, 2^n, 3^n, etc.> <Absurdity is obvious. The proof of the FLT is done> How absurd. Silly that the greatest mathematicians in the world over the last 400 years didn't notice this. LOL


Alert  IP 
Printerfriendly page 
Reply 
Reply With Quote  Top 


You may be curious to have a look at the old CTK Exchange archive. Please do not post there.
Front page
Contents
Copyright © 19962018 Alexander Bogomolny

