<--- Back to Details
First PageDocument Content
Polynomials / Elementary algebra / Partial fraction / Axiom / Euclidean algorithm / Square-free polynomial / Rational function / Greatest common divisor / Integral / Mathematics / Abstract algebra / Algebra
Date: 2012-06-11 00:33:59
Polynomials
Elementary algebra
Partial fraction
Axiom
Euclidean algorithm
Square-free polynomial
Rational function
Greatest common divisor
Integral
Mathematics
Abstract algebra
Algebra

Add to Reading List

Source URL: axiom-developer.org

Download Document from Source Website

File Size: 1,43 MB

Share Document on Facebook

Similar Documents

Mathematical analysis / Mathematics / Spectral theory / Operator theory / Plancherel theorem for spherical functions / Representation theory of Lie groups / Macdonald polynomials

A General Approach to Isolating Roots of a Bitstream Polynomial Michael Sagraloff Abstract. We describe a new approach to isolate the roots (either real or complex) of a square-free polynomial F with real coefficients. I

DocID: 1kHUw - View Document

Integer sequences / Algebra / Polynomials / FO / Computational complexity theory / Prime number / Primality test / Square-free integer / Irreducible polynomial / Mathematics / Theoretical computer science / Complexity classes

Boolean Decision Functions Steven Finch April 22, 2015 Let  : {0 1} → {0 1} be the Boolean function that decides whether a given ( + 1)-bit odd integer is square-free. More precisely, ½

DocID: 180DU - View Document

Partial fraction / Binomial coefficient / Rational function / Square-free polynomial / Factorization / Continued fraction / Algebraic fraction / Complex number / Degree of a polynomial / Mathematics / Polynomials / Algebra

Symbolic algebra and Mathematics with Xcas Renée De Graeve, Bernard Parisse University of Grenoble I 2 c 2002, 2007 Renée De Graeve, Bernard Parisse

DocID: Fyna - View Document

Algebraic number theory / Integer sequences / Elementary number theory / Integer / Ring theory / Number / Square-free integer / Binomial coefficient / Mathematics / Abstract algebra / Number theory

U OF I MOCK PUTNAM EXAM SEPT. 29, [removed]Suppose P (x) is a polynomial with integer coefficients such that none of the values P (1), . . . , P[removed]is divisible by[removed]Prove that P (n) 6= 0 for all integers n. 2. Fi

DocID: 7p9d - View Document

Polynomials / Elementary algebra / Partial fraction / Axiom / Rational function / Euclidean algorithm / Square-free polynomial / Greatest common divisor / Integral / Mathematics / Mathematical analysis / Algebra

The 30 Year Horizon M anuel Bronstein James Davenport Albrecht F ortenbacher Jocelyn Guidry M ichael M onagan

DocID: 6zfe - View Document