AMERICA EARTH PROUD DAY FUNDAMENTALS

THE LOST FUNDAMENTAL sent
Fermat's Last Theorem - FUNDAMENTAL

THE LOST FUNDAMENTAL

or Ion Murgu - Integers Powers Fundamental Equations.

The fundamental which via FMIE sent Fermat's Last Theorem in - FUNDAMENTAL

HUMANITY SCINECE THESAURUS

those equations not only lightened near of 400 years of research about - Fermat's Last Theorem , but brought a lot more.

Ion Murgu - Integers Powers Fundamental Equations.

Those Fundamental Equations had first aproach around of '75-'76 when calculus error, avoided the chance to be Discovered then.

First Method for geting Proof for existence, will be Explained Down.

For My The Importance Of Those Equations Is More then Biggest, But for Science is
how will evolve - ESSENCES - HST - GOLDEN NUMBERS EQUATIONS AND a new Image about Prime Numbers Connections .
Maybe we can speak about a new aproach in NUMBERS THEORY .


A schema for general case, working directly with powers, which in reality was tested on particular cases for n=2,n=3,n=4,n=5,n=6


>
Tn (T+1)n (T+2)n (T+n-1)n (T+n)n
(T+1)n-Tn (T+2)n-(T+1)n (T+3)n-(T+2)n (T+n)n-(T+n-1)n
dif. of superior terms dif. of superior terms dif. of superior terms
dif. of superior terms dif. of superior terms
n!

and now for n=4 , starting from T=2

>
16812566251296
65175369671
110194302
84108
24

24 is also 4!



GETTING FORMULA

What been waiting for is proved, as remark I did it for n=2, n=3, n=4, n=5, n=6 and n=7, then not a motivation to exclude general case, and late on I make a software which proved it for n between 1 and 50. Then, I made second STEP, to get The Formula, and for it I keept the powers from first row as functions of I and n. We will do it for n=4, for general case is heavy to make a schema, but as I said a Software ( a PERL script will proved it, and is on Internet already by a long time )

fTfT+1 fT+2 fT+3 fT+4
fT+1-fT fT+2-fT+1 fT+3-fT+2 fT+4-fT+3
fT+2-2*fT+1+fTfT+3-2*fT+2+fT+1fT+4-2*fT+3+fT+2
fT+3-3*fT+2+3*fT+1-fT fT+4-3*fT+3+3*fT+2-fT+1
fT+4-4*fT+3+6*fT+2-4*fT+1+fT

For general cases a Table will be To big , but an atempt can be made(I did) needed to see the Evolving Coefficients (Pascal Triangle). A Computing form is a easy procedure, because every superiors Coefficients are evolving also from the precedents.

u root(n)
n=111
n=2121
n=3133 1
n=41464 1
n=515101051
n=61615201561
n=7172135352171
n=818285670562881
n=9 1 9 36 84 126 126 84 36 9 1
n=10 1 10 45 120 210 252 210 120 45 10 1
n=11 1 11 55 165 330 462 462 330 165 55 11 1
n=12 1 12 66 220 495 792 924 792 495 220 66 12 1
n=13 1 13 78 286 715 1287 1716 1287 715 286 78 13 1
n=1411491364100120023003343230032002100136491141
n=1511510545513653003500564356435500530031365455105151
n=16116120560182043688008114401287011440800843681820560120161
n=17117136680238061881237619448243102431019448 1237661882380680136171
n=18118153816306085681856431824437584862043758318241856485683060816153181
n=191191719693876116282713250388755829237892378755825038827132116283876969171191
n=201201901140484515504387607752012597016796018475616796012597077520387601550448451140190201
n=21121210133059852034954264116280203490293930352716352716293930203490116280542642034959851330210211

AND SO ON - coeeficients table -



Now we have Formula in the front of us in two forms.


HUMANITY SCIENCE THESAURUS

  0
  ∑ [ (-1)m(kI,n)(T+I)n]= n!
  I=n

WHERE m IS ; FOR N ODD m=(I+1) , FOR N EVEN (m=I)


HUMANITY SCIENCE THESAURUS inverse descend

  0
  ∑ [ (-1)m(kI,n)(T-I)n]= n!
  I=n

WHERE m IS ; FOR N ODD m=(I+1) , FOR N EVEN (m=I)



THOSE INFINITY TO INFINITY EQUATION - IDENTITIES ARE IMPORTANT FOR , BECAUSE EXPRES ABSOLUTE TRUTH . EVEN PRIME NUMBERS GET NOW THE CONNECTION WITH ALL NUMBERS ON.

THOSE INFINITY TO INFINITY EQUATION - IDENTITIES I HAD the dare, with your permission, to name - HUMANITY SCIENCE THESAURUS - . And it, not because I get it, but because are. Are simple now, but we needed 7000 years of Scince to get it. To not confuse it whith Pascal Equations what been obtained by simple evolving of (a+b)n by multiple multiply of (a+b)... (a+b). Here we get the real conection whth n!. In first place, I named THOSE INFINITY TO INFINITY EQUATION - IDENTITIES as ION MURGU - MATH MILLENIUM EQUATIONS as a remark we get at the begin of Millennium any important aproach, but late, I renamed it ION MURGU - INTEGERS POWERS FUNDAMENTAL EQUATIONS - TO REMARK THE RIGHT TO fundamental.


Those Equations have the rigt also to be named :
THE LOST FUNDAMENTAL
and expres
ABSOLUTE TRUTH

tO REMARK the property of adition and then WE CAN GET NOW Infinity to Infinity Connection between all Integers Including Prime Numbers Prime Numbers - a GOOD NEW TOOL into Numbers Theory, but for sure also into work with pollinomial functions.

     REMARKS  


    I


  0
  ∑ [ (-1)m(kI,n)(A-I)n]
  I=n
   +  
  0
  ∑ [ (-1)m(kI,n)(B-I)n]
  I=n
  =  (n!) + [(n-1)!]  

where A,B Integers , and also can be equals. and |A|>=n and |B|>=(n-1). Remark right side can to be wite also as {(n+1)[(n-1)!]}. this kind of connections can be utils in polinamials.

  II


  0
  ∑ [ (-1)m(kI,n)(A-I)n]
  I=n
-----------------------------  =    1
  0
  ∑ [ (-1)m(kI,n)(B-I)n]
  I=n

A and B can be equals or not


  III


  0
  ∑ [ (-1)m(kI,n)(A-I)n]
  I=n
  -   
  0
  ∑ [ (-1)m(kI,n)(B-I)n]
  I=n
  =0

A and B can be equals or not


Ion Murgu- Integers Powers Equqtions will play a role in Numbers Theory

Via Ion Murgu- Integers Powers Equations, Prime Numbers can be wrie now in multiple forms.
Polinomial function also.
Those equations are valids for T Integer >n , and it expose the same problem which appear in Complex Numbers , see Riemann hypotesis.
Those equations EXPRES - ABSSOLUTE TRUTH, AND CAN BE TESTED BY 2 YEARS AND THE HALF at : www.lifeclimatic.com/mmc.pl , and now under this software. Ion Murgu Integers Powers Fundamental Equation present also a impass of interfernce on all Integers Axes , and is coming from desechilbre introduced by interval [-1,1],which in Riemann Hypotesios wear anyher aspect by refleted. FORMULA for Ion Murgu Integers Powers Equations working on Intervales [-1,∞] and [1,∞] is down:

  0
  ∑ [ (-1)m(kI,n)(B+I)n]
  I=n

Diference is "m" will be m=(I+1) for n par , and m=I for n odd

As you will see: Ion Murgu Integers Powers Fundamental Equations can CERTIFY Fermat's Last Theorem , VIA an Analytic Math Method named, maybe improper, Fermat-Murgu Impossible Equations. Ion Murgu Integers Powers Fundamental Equations lighted totally Fermat's Last Theorem , Generalize it by sending all Fermat Equations Solutions Into Irrational Field

© 2015 - for: Ion Murgu Integers Powers Fundamental Equations, Fermat's Last Theorem Fundamental,Fermat-Murgu Impossibe Equations, Fermat-Murgu Quadruplets, Euler - Murgu Equations 1=1 .