Other examples are solutions of linear differential equations with polynomial coefficients. The solutions of linear differential equations with polynomial coefficients are called holonomic functions. Algebraic numbers are those that are a solution to a polynomial equation with integer coefficients. Sequences which are the solutions of linear difference equations with polynomial coefficients are called P-recursive. Algebra also studies Diophantine equations where the coefficients and solutions are integers. The decompressor computes the inverse transform based on this reduced number of Fourier coefficients. The resulting coefficients are termed compliance constants. A real polynomial is a polynomial with real coefficients. The zigzag sequence for the above quantized coefficients are shown below. A polynomial that is irreducible over any field containing the coefficients is absolutely irreducible. The encoding of the 63 quantized AC coefficients does not use such prediction differencing. The case of polynomials with integer coefficients is fundamental for computer algebra. This representation allows for obtaining MAD median correlation coefficients. Vieta's formulas give a simple relation between the roots of a polynomial and its coefficients. The interpolation problem consists of determining the 16 coefficients formula 10.