Search results
Results from the WOW.Com Content Network
In elementary algebra, root rationalisation (or rationalization) is a process by which radicals in the denominator of an algebraic fraction are eliminated.. If the denominator is a monomial in some radical, say , with k < n, rationalisation consists of multiplying the numerator and the denominator by , and replacing by x (this is allowed, as, by definition, a n th root of x is a number that ...
The odd greedy algorithm cannot terminate when given a fraction with an even denominator, because these fractions do not have finite representations with odd denominators. Therefore, in this case, it produces an infinite series expansion of its input. For instance Sylvester's sequence can be viewed as generated by the odd greedy expansion of 1/2.
Simplifying this further gives us the solution x = −3. It is easily checked that none of the zeros of x ( x + 1)( x + 2) – namely x = 0 , x = −1 , and x = −2 – is a solution of the final equation, so no spurious solutions were introduced.
In the case of two nested square roots, the following theorem completely solves the problem of denesting. [2]If a and c are rational numbers and c is not the square of a rational number, there are two rational numbers x and y such that + = if and only if is the square of a rational number d.
A method analogous to piece-wise linear approximation but using only arithmetic instead of algebraic equations, uses the multiplication tables in reverse: the square root of a number between 1 and 100 is between 1 and 10, so if we know 25 is a perfect square (5 × 5), and 36 is a perfect square (6 × 6), then the square root of a number greater than or equal to 25 but less than 36, begins with ...
When a partial fraction term has a single (i.e. unrepeated) binomial in the denominator, the numerator is a residue of the function defined by the input fraction. We calculate each respective numerator by (1) taking the root of the denominator (i.e. the value of x that makes the denominator zero) and (2) then substituting this root into the ...
A Chebyshev polynomial of either kind with degree n has n different simple roots, called Chebyshev roots, in the interval [−1, 1]. The roots of the Chebyshev polynomial of the first kind are sometimes called Chebyshev nodes because they are used as nodes in polynomial interpolation.
Budan's may provide a real-root-isolation algorithm for a square-free polynomial (a polynomial without multiple root): from the coefficients of polynomial, one may compute an upper bound M of the absolute values of the roots and a lower bound m on the absolute values of the differences of two roots (see Properties of polynomial roots).