Search Results for ""
341 - 350 of 1310 for Lagrange Interpolating PolynomialSearch Results
A geodesic on a paraboloid x = sqrt(u)cosv (1) y = sqrt(u)sinv (2) z = u (3) has differential parameters defined by P = ...
A parallelogram polyomino is a polyomino such that the intersection with every line perpendicular to the main diagonal is a connected segment. The number of parallelogram ...
If alpha is any number and m and n are integers, then there is a rational number m/n for which |alpha-m/n|<=1/n. (1) If alpha is irrational and k is any whole number, there ...
For algebraic alpha |alpha-p/q|<1/(q^(2+epsilon)), with epsilon>0, has finitely many solutions. Klaus Roth received a Fields medal for this result.
Two elements alpha, beta of a field K, which is an extension field of a field F, are called conjugate (over F) if they are both algebraic over F and have the same minimal ...
A quotient of two polynomials P(z) and Q(z), R(z)=(P(z))/(Q(z)), is called a rational function, or sometimes a rational polynomial function. More generally, if P and Q are ...
In logic, a term is a variable, constant, or the result of acting on variables and constants by function symbols. In algebra, a term is a product of the form x^n (in the ...
The primitive part of a polynomial P(x) is P(x)/k, where k is the content. For a general univariate polynomial P(x), the Wolfram Language function FactorTermsList[poly, x] ...
The companion matrix to a monic polynomial a(x)=a_0+a_1x+...+a_(n-1)x^(n-1)+x^n (1) is the n×n square matrix A=[0 0 ... 0 -a_0; 1 0 ... 0 -a_1; 0 1 ... 0 -a_2; | | ... ... |; ...
Eisenstein's irreducibility criterion is a sufficient condition assuring that an integer polynomial p(x) is irreducible in the polynomial ring Q[x]. The polynomial ...
...