User Name Remember Me? Password

 Number Theory Number Theory Math Forum

 April 26th, 2015, 12:36 AM #1 Banned Camp   Joined: Dec 2012 Posts: 1,028 Thanks: 24 FLT reduced to 2th degree equations It's possible to reduce the FLT also for n>=3 to a 2th degree equation. For what already shown (and using a new trick on): 1) 2) 3) So if 4) than 5) OR 6) So we can call: 7) So Delta is the quantity to be added or removed to obtain C^n. But we also know that is possible to "linearize", for example if n=ODD and n>=3 then we can write: 1b 2b 3b Now expressing A^n and B^n as areas of the primitive that is a triangle, so limits of the step sum step 1/k for k->infinity 1b 1b so A^n and B^n as integral of the primitive (area of triangles), 1c So we can put in relation 2 rectangles: 8a and the same for B^n 8b And have clear that FLT ask if there is an integer solution for a rectangle that has an area C^n that is between this 2 areas at the known condition: 5) and 6) Where Delta is here an area that must be added to the area 2A^n, or subtracted from 2B^n. So we have now clear that the rectangular area (that is C^n) upper right corner P3, will lies on the line that pass trough the 2 rectagle upper right corners P1,P2: So P3 is at a certain distance from P1, or at certain x from A^{((n-1)/2)} and at certain distance y=A^{((n+1)/2)} + Tg(alpha) And that distance x has to satisfy the conditions that the upper (Delta), and lower (Delta) areas are equal. So since 2A^n and 2B^n are for sure integers, if FLT has an integer solution, than also Delta must be an integer area. So the 2th degree Equation that SOLVES ANY "n" Odd is (5) = (6) so: So 6) where Delta is the area: 9) where But my question is: is this enought, using some rules of the 2th dergee equation (not Wiles) to prove there are not integer solutions ? Thanks Ciao Stefano Last edited by complicatemodulus; April 26th, 2015 at 12:41 AM. April 26th, 2015, 01:04 AM #2 Banned Camp   Joined: Dec 2012 Posts: 1,028 Thanks: 24 Here the picture (remember n>=3 and n= Odd) Last edited by complicatemodulus; April 26th, 2015 at 01:12 AM. April 26th, 2015, 09:10 PM #3 Banned Camp   Joined: Dec 2012 Posts: 1,028 Thanks: 24 OK, time out... The correct answer is: is not necessary to make the calculation since, as shown here also with pictures, FLT imply an (infimus) condition that just squares can satisfy. And, as in my suspect from the beginning, the final proof pass trough a differential equations, but what I not suspect, is that this differential equation is so easy, and under our nose from the beginning. Thanks, Ciao Stefano Sorry for the too many wrong trick posted here.... but it was my trip... April 27th, 2015, 06:05 AM   #4
Global Moderator

Joined: Nov 2006
From: UTC -5

Posts: 16,046
Thanks: 938

Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms
Quote:
 Originally Posted by complicatemodulus 9) where But my question is: is this enought, using some rules of the 2th dergee equation (not Wiles) to prove there are not integer solutions ?
Of course not. You still have very large degree, you just moved it to other variables. April 27th, 2015, 07:14 AM #5 Banned Camp   Joined: Dec 2012 Posts: 1,028 Thanks: 24 Yes thanks, but you miss my previous answer. It seems to me that there is a differential equation that solve the FLT problem. Thansk Ciao Stefano May 2nd, 2015, 10:42 PM #6 Banned Camp   Joined: Dec 2012 Posts: 1,028 Thanks: 24 I hope this will be more clear: FLT ask when the system of 3 equations has a result in the integers: (1) (2) (3) I show that the (1) can be written in 2 ways: (4a) (4b) So coupling the (4a) and (2), (4b) and (3) we have: (5a) (5b) Where MixA and MixB are the two mixed products of the 2 binomial developes. So FLT state that: (5a) (5b) or summing the two: or: Now using again the right develope for C^n: (6a) gives: and: (6b) gives: Ok, all this to say that we have a system and certain conditions... I'm looking for a shortcut to avoid other more complicate concerning: I already found and show that this system has a solution for any value of A (or B, or C) for n=2. So is it possible that there will be 2 solution for A, one for n=2 and another for the same A for n >=3 ? Thanks ciao Stefano Tags 2th, degree, equations, flt, reduced Thread Tools Show Printable Version Email this Page Display Modes Linear Mode Switch to Hybrid Mode Switch to Threaded Mode Similar Threads Thread Thread Starter Forum Replies Last Post TGPT I Rick Elementary Math 12 December 29th, 2016 11:02 AM lreps Abstract Algebra 0 April 12th, 2011 07:00 AM remeday86 Linear Algebra 1 June 22nd, 2010 07:10 PM shigatyshwa Linear Algebra 1 February 12th, 2009 07:34 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top

Copyright © 2019 My Math Forum. All rights reserved.      