<--- Back to Details
First PageDocument Content
Algebra / Greatest common divisor / Finite fields / Computer algebra / Factorization of polynomials over a finite field and irreducibility tests / Greatest common divisor of two polynomials / Mathematics / Abstract algebra / Polynomials
Date: 2006-12-11 05:29:30
Algebra
Greatest common divisor
Finite fields
Computer algebra
Factorization of polynomials over a finite field and irreducibility tests
Greatest common divisor of two polynomials
Mathematics
Abstract algebra
Polynomials

Add to Reading List

Source URL: www.science.unitn.it

Download Document from Source Website

File Size: 58,97 KB

Share Document on Facebook

Similar Documents

Algebra / Separable polynomial / Mathematics of CRC / Greatest common divisor of two polynomials / Polynomials / Mathematics / Abstract algebra

CS 70 Spring 2008 Discrete Mathematics for CS David Wagner

DocID: 1aq6d - View Document

Polynomials / Euclidean algorithm / Degree of a polynomial / Greatest common divisor / Factorization of polynomials over a finite field and irreducibility tests / Greatest common divisor of two polynomials / Abstract algebra / Mathematics / Algebra

UNIVERSITY OF BELGRADE FACULTY OF MATHEMATICS Samira M. Zeada Classification of Monomial Orders In Polynomial Rings and Gr¨

DocID: 15F3G - View Document

Integer sequences / Number theory / Division / Greatest common divisor / Divisor function / Divisor / Prime number / Greatest common divisor of two polynomials / Irreducible fraction / Mathematics / Arithmetic / Numbers

Greatest Common Divisor The greatest common divisor (often abbreviated to gcd) between two numbers is the greatest number that is a factor of both numbers. For example, the greatest common divisor of 6 and 4 is 2. To fin

DocID: xU74 - View Document

Arithmetic / Elementary arithmetic / Least common multiple / Greatest common divisor / Euclidean algorithm / Greatest common divisor of two polynomials / Mathematics / Polynomials / Multiplicative functions

The 69th William Lowell Putnam Mathematical Competition Saturday, December 6, 2008 A1 Let f : R2 → R be a function such that f (x, y) + f (y, z) + f (z, x) = 0 for all real numbers x, y, and z. Prove that there exists

DocID: cR7k - View Document

Polynomials / Computer algebra / Finite fields / Euclidean algorithm / Factorization of polynomials / Integer factorization algorithms / Greatest common divisor / Prime number / Algebraic number field / Mathematics / Abstract algebra / Algebra

Modular Methods in CoCoA What are modular methods? When you have to do a quick calculation on the back of an envelope, you might calculate the sum or product of two (small) polynomials, and you would most likely use a di

DocID: bO2A - View Document