• 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
171S4.4q Theorems about Zeros of Polynomial Functions
171S4.4q Theorems about Zeros of Polynomial Functions

How to solve f (x ) = g (y )...
How to solve f (x ) = g (y )...

... It turns out that: d is a congruent number if, and only if, the elliptic curve Ed : y 2 = x 3 − d 2 x has a solution with y 6= 0. In fact, a2 + b 2 = c 2 , 21 ab = d implies bd/(c − a), 2d 2 /(c − a) is a rational solution of y 2 = x 3 − d 2 x. Conversely, a rational solution of y 2 = x 3 − d 2 x wi ...
prob set
prob set

Grade 6 Mathematics Module 2, Topic C, Lesson 12
Grade 6 Mathematics Module 2, Topic C, Lesson 12

Chap 14 Factorization
Chap 14 Factorization

3.4 Zeros of Polynomial Functions
3.4 Zeros of Polynomial Functions

Factorisation
Factorisation

Elementary Number Theory Definitions and Theorems
Elementary Number Theory Definitions and Theorems

Question 1.
Question 1.

Fast Exponentiation with Precomputation: Algorithms and Lower
Fast Exponentiation with Precomputation: Algorithms and Lower

離散對數密碼系統 - 國立交通大學資訊工程學系NCTU Department of
離散對數密碼系統 - 國立交通大學資訊工程學系NCTU Department of

I(x)
I(x)

CHAPTER 3: Cyclic Codes
CHAPTER 3: Cyclic Codes

... IV054 Hamming codes as cyclic codes Definition (Again!) Let r be a positive integer and let H be an r * (2r -1) matrix whose columns are distinct non-zero vectors of V(r,2). Then the code having H as its parity-check matrix is called binary Hamming code denoted by Ham (r,2). It can be shown that bi ...
The Simplest Cubic Fields - American Mathematical Society
The Simplest Cubic Fields - American Mathematical Society

On the Prime Ideals in a Commutative Ring
On the Prime Ideals in a Commutative Ring

Chapter I, Section 6
Chapter I, Section 6

How many Primes Are There?
How many Primes Are There?

M10-200 A Projection Access Scheme for Iterative
M10-200 A Projection Access Scheme for Iterative

4 Polynomial and Rational Functions
4 Polynomial and Rational Functions

Mathematics 20
Mathematics 20

3.3 more about zeros
3.3 more about zeros

The least prime primitive root and the shifted sieve
The least prime primitive root and the shifted sieve

a, b
a, b

Prime numbers in certain arithmetic progressions
Prime numbers in certain arithmetic progressions

MATH 13150: Freshman Seminar Exam #2 Practice Problems for
MATH 13150: Freshman Seminar Exam #2 Practice Problems for

< 1 ... 55 56 57 58 59 60 61 62 63 ... 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