• 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
23. Dimension Dimension is intuitively obvious but - b
23. Dimension Dimension is intuitively obvious but - b

ANALYTIFICATION AND TROPICALIZATION OVER NON
ANALYTIFICATION AND TROPICALIZATION OVER NON

Universal enveloping algebras and some applications in physics
Universal enveloping algebras and some applications in physics

Large gaps between consecutive prime numbers
Large gaps between consecutive prime numbers

x,y
x,y

@comment -*-texinfo-*- @comment $Id: plumath,v 1.18 2004
@comment -*-texinfo-*- @comment $Id: plumath,v 1.18 2004

Word - Toledo Math department
Word - Toledo Math department

29(2)
29(2)

... It is clear from their construction that Bn(x) is a polynomial of degree n. They are defined in the interval 0 < x < 1. Their periodic continuation outside this interval are called Bernoulli functions. The constant terms of the Bernoulli polynomials form a particularly interesting set of numbers. We ...
SIMPLE GROUPS ARE SCARCE X)-log log x
SIMPLE GROUPS ARE SCARCE X)-log log x

Polynomials - Mr
Polynomials - Mr

... Hence solve the equation 2x3 + x2 + kx + 2 = 0 when k takes this value. 13. Given that (x – 2) and (x + 3) are factors of f(x) = 3x3 + 2x2 + cx + d, find the values of ‘c’ and ‘d’. ...
The Fundamentals: Algorithms, the Integers, and Matrices
The Fundamentals: Algorithms, the Integers, and Matrices

Hankel Matrices: From Words to Graphs
Hankel Matrices: From Words to Graphs

INTRODUCTION TO FINITE GROUP SCHEMES Contents 1. Tate`s
INTRODUCTION TO FINITE GROUP SCHEMES Contents 1. Tate`s

GAUGE THEORY 1. Fiber bundles Definition 1.1. Let G be a Lie
GAUGE THEORY 1. Fiber bundles Definition 1.1. Let G be a Lie

... Definition 1.1. Let G be a Lie group, ρ : G × F → F a smooth left action of G on a π manifold F , and M a manifold. A fiber bundle E → M with structure (gauge) group G and fiber F on the manifold M is a submersion π : E → M such that there exists an atlas {(U, ψU ) | U ∈ U} of local trivializations ...
C-LOOPS - University of Denver
C-LOOPS - University of Denver

AN INEQUALITY INVOLVING PRIME NUMBERS
AN INEQUALITY INVOLVING PRIME NUMBERS

Decimal expansions of fractions
Decimal expansions of fractions

Derived Representation Theory and the Algebraic K
Derived Representation Theory and the Algebraic K

... Remark: Throughout this paper, all Hom and smash product spectra will be computed using only cofibrant modules. If a module is not cofibrant by construction, we will always replace it with a weakly equivalent cofibrant model. We will sometimes do this without comment. An important method for constru ...
Recursion
Recursion

On the characterization of compact Hausdorff X for which C(X) is
On the characterization of compact Hausdorff X for which C(X) is

What is Index Calculus?
What is Index Calculus?

... surjection Div0 (C) −→ Cl0 (C/K), and again Div0 (C/K) is a free abelian group. Moreover, we have a ”more or less canonical” lifting. This can be used for index calculus. However: For an elliptic curve the lifting is given by P ←→ [P ] − [O] 7→ (P ) − (O). This is ”too easy”. (No factorization possi ...
Rewriting Systems for Coxeter Groups
Rewriting Systems for Coxeter Groups

Extended Affine Root Systems II (Flat Invariants)
Extended Affine Root Systems II (Flat Invariants)

THE CHINESE REMAINDER THEOREM INTRODUCED IN A
THE CHINESE REMAINDER THEOREM INTRODUCED IN A

Exponent and Logarithm Practice Problems for Precalculus and
Exponent and Logarithm Practice Problems for Precalculus and

< 1 ... 13 14 15 16 17 18 19 20 21 ... 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