• Study Resource
  • Explore
    • Arts & Humanities
    • Business
    • Engineering & Technology
    • Foreign Language
    • History
    • Math
    • Science
    • Social Science

    Top subcategories

    • Advanced Math
    • Algebra
    • Basic Math
    • Calculus
    • Geometry
    • Linear Algebra
    • Pre-Algebra
    • Pre-Calculus
    • Statistics And Probability
    • Trigonometry
    • other →

    Top subcategories

    • Astronomy
    • Astrophysics
    • Biology
    • Chemistry
    • Earth Science
    • Environmental Science
    • Health Science
    • Physics
    • other →

    Top subcategories

    • Anthropology
    • Law
    • Political Science
    • Psychology
    • Sociology
    • other →

    Top subcategories

    • Accounting
    • Economics
    • Finance
    • Management
    • other →

    Top subcategories

    • Aerospace Engineering
    • Bioengineering
    • Chemical Engineering
    • Civil Engineering
    • Computer Science
    • Electrical Engineering
    • Industrial Engineering
    • Mechanical Engineering
    • Web Design
    • other →

    Top subcategories

    • Architecture
    • Communications
    • English
    • Gender Studies
    • Music
    • Performing Arts
    • Philosophy
    • Religious Studies
    • Writing
    • other →

    Top subcategories

    • Ancient History
    • European History
    • US History
    • World History
    • other →

    Top subcategories

    • Croatian
    • Czech
    • Finnish
    • Greek
    • Hindi
    • Japanese
    • Korean
    • Persian
    • Swedish
    • Turkish
    • other →
 
Profile Documents Logout
Upload
(Less) Abstract Algebra
(Less) Abstract Algebra

Multiply a polynomial
Multiply a polynomial

... What we’ve really done in the second step, is multiply 7 by 20, then add the 20 left over from the first step to get 160. We add this to the 1 to get 161. ...
The Think Tank - Berkeley County Schools
The Think Tank - Berkeley County Schools

Lecture 3.4
Lecture 3.4

Generalizing Continued Fractions - DIMACS REU
Generalizing Continued Fractions - DIMACS REU

Lecture 3.4
Lecture 3.4

... The Factor Theorem tells us that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we study some algebraic methods that help us to find the real zeros of a polynomial and thereby factor the polynomial. We begin with the rational zeros of ...
problem 4.3 – using prime factorizations
problem 4.3 – using prime factorizations

IOSR Journal of Computer Engineering (IOSR-JCE)
IOSR Journal of Computer Engineering (IOSR-JCE)

... Genetic algorithm is an adaptive global optimization probability search algorithm, which simulates the biological genetic and evolution process in the natural environment [1]. A general framework for solving the optimization problem of complex systems is provided, which does not depend on the specif ...
FINDING PRIME NUMBERS: MILLER RABIN AND BEYOND 1
FINDING PRIME NUMBERS: MILLER RABIN AND BEYOND 1

Solutions and Comments on Homework 3 Decimals and Irrational
Solutions and Comments on Homework 3 Decimals and Irrational

CS440 - Assignment 3
CS440 - Assignment 3

What is. . . an L-function? - Mathematisch Instituut Leiden
What is. . . an L-function? - Mathematisch Instituut Leiden

Your book defines the first and second order Taylor - Math-UMN
Your book defines the first and second order Taylor - Math-UMN

Experiment 2 Sorting Methods-Bubble, Selection
Experiment 2 Sorting Methods-Bubble, Selection

p-1 - CS Wiki
p-1 - CS Wiki

Final Review Problems
Final Review Problems

Math141 – Practice Test # 4 Sections 3
Math141 – Practice Test # 4 Sections 3

f``(c)
f``(c)

Module 3 notes -Polynomial A polynomial is an algebraic
Module 3 notes -Polynomial A polynomial is an algebraic

... Notice, in the example above, a lot of detail was provided within each step to eliminate confusion. As you practice, you will become more proficient at putting polynomials in factored form, and you will need fewer steps. ...
Vocabulary to Review
Vocabulary to Review

Algebraic Number Theory Notes: Local Fields
Algebraic Number Theory Notes: Local Fields

(pdf)
(pdf)

... on an elliptic curve given in 1.7, membership in the kernel may be specified by a polynomial in x and y, and adjoining the roots of that polynomial gives us a finite extension of K with the desired property, to which we may apply 3.2. We now reduce the question of the finiteness of E(K)/mE(K) to a q ...
18.310A Final exam practice questions
18.310A Final exam practice questions

CS311H: Discrete Mathematics Number Theory Announcements
CS311H: Discrete Mathematics Number Theory Announcements

ALGORITHMS FOR D-FINITE FUNCTIONS 1. Introduction A function
ALGORITHMS FOR D-FINITE FUNCTIONS 1. Introduction A function

... explicit expression f (x) = · · · , this is not always the case for D-finite functions. Instead, D-finite functions are specified implicitly through the differential equation they satisfy, plus an appropriate number of initial values. The situation is similar to the treatment of algebraic numbers: s ...
< 1 ... 116 117 118 119 120 121 122 123 124 ... 231 >

Factorization of polynomials over finite fields

In mathematics and computer algebra the factorization of a polynomial consists of decomposing it into a product of irreducible factors. This decomposition is theoretically possible and is unique for polynomials with coefficients in any field, but rather strong restrictions on the field of the coefficients are needed to allow the computation of the factorization by means of an algorithm. In practice, algorithms have been designed only for polynomials with coefficients in a finite field, in the field of rationals or in a finitely generated field extension of one of them.The case of the factorization of univariate polynomials over a finite field, which is the subject of this article, is especially important, because all the algorithms (including the case of multivariate polynomials over the rational numbers), which are sufficiently efficient to be implemented, reduce the problem to this case (see Polynomial factorization). It is also interesting for various applications of finite fields, such as coding theory (cyclic redundancy codes and BCH codes), cryptography (public key cryptography by the means of elliptic curves), and computational number theory.As the reduction of the factorization of multivariate polynomials to that of univariate polynomials does not have any specificity in the case of coefficients in a finite field, only polynomials with one variable are considered in this article.
  • studyres.com © 2025
  • DMCA
  • Privacy
  • Terms
  • Report