Search results
Results From The WOW.Com Content Network
Polynomial factoring algorithms use basic polynomial operations such as products, divisions, gcd, powers of one polynomial modulo another, etc. A multiplication of two polynomials of degree at most n can be done in O(n 2) operations in F q using "classical" arithmetic, or in O(nlog(n) log(log(n)) ) operations in F q using "fast" arithmetic.
Start with division by 2: the number is even, and n = 2 · 693. Continue with 693, and 2 as a first divisor candidate. 693 is odd (2 is not a divisor), but is a multiple of 3: one has 693 = 3 · 231 and n = 2 · 3 · 231. Continue with 231, and 3 as a first divisor candidate. 231 is also a multiple of 3: one has 231 = 3 · 77, and thus n = 2 ...
Modern algorithms and computers can quickly factor univariate polynomials of degree more than 1000 having coefficients with thousands of digits. [3] For this purpose, even for factoring over the rational numbers and number fields, a fundamental step is a factorization of a polynomial over a finite field.
Shifting the a 0 term to the right side and factoring out p on the left side produces: (+ + +) =. Thus, p divides a 0 q n . But p is coprime to q and therefore to q n , so by Euclid's lemma p must divide the remaining factor a 0 .
Given a quadratic polynomial of the form + + it is possible to factor out the coefficient a, and then complete the square for the resulting monic polynomial. Example: + + = [+ +] = [(+) +] = (+) + = (+) + This process of factoring out the coefficient a can further be simplified by only factorising it out of the first 2 terms.
For instance, the polynomial x 2 + 3x + 2 is an example of this type of trinomial with n = 1. The solution a 1 = −2 and a 2 = −1 of the above system gives the trinomial factorization: x 2 + 3x + 2 = (x + a 1)(x + a 2) = (x + 2)(x + 1). The same result can be provided by Ruffini's rule, but with a more complex and time-consuming process.
The FOIL rule converts a product of two binomials into a sum of four (or fewer, if like terms are then combined) monomials. [6] The reverse process is called factoring or factorization. In particular, if the proof above is read in reverse it illustrates the technique called factoring by grouping.
The polynomial x 2 + 2x + 2, on the other hand, is primitive. Denote one of its roots by α. Then, because the natural numbers less than and relatively prime to 3 2 − 1 = 8 are 1, 3, 5, and 7, the four primitive roots in GF(3 2) are α, α 3 = 2α + 1, α 5 = 2α, and α 7 = α + 2. The primitive roots α and α 3 are algebraically conjugate.