Okay, okay I be honest.
I used something called "method of least squares" for polynomials. It works for other class of functions. When I use this I looks whether or not this function is "good" looking. Meaning are the coefficients nice or ugly? If nice like here I assume that is the pattern. CaptainBlank referrs to it as the "Lagrange Interpolating polynomial".
In fact I can prove that given a sequence:
We can find a unique polynomial having a degree up to (n-1) with precisely satisfies this equation. (The prove is based on being able to solve a system of linear equations).
go through the points. It just so happens that a least squares polynomial
fit of a degree n-1 polynomial to a squence of n points must also go through
the points and so in practice is identical to the Lagrange polynomial, but
they differ in their method of construction.
Here the least square and the Lagrange polynomials are the same but the
distinction between them remains as it lies in their methods of construction.
lunch hour ) results in me editing a post while the original is uploading
without noticing, then hitting submit again
Its also a type of double posting I don't mind too much when others do
it. Near identical posts in the same thread (of forum) are usually finger
trouble, best way to deal with them is to just delete the duplicate.