Authors and affiliations
Two polynomials from ℤ[x] are called evaluationally relatively prime if the greatest common divisor of the two polynomials in ℤ[x] is 1 and gcd(f(t); g(t)) = 1 for all t ∈ ℤ: A characterization is given for when a linear function is evaluationally relatively prime with another polynomial.
- Relatively prime
- Cohn, P. M. (2000) An Introduction to Ring Theory, Springer, London.
- Niven, I., Zuckerman, H., & Montgomery. H. (1991) An Introduction to The Theory of Numbers, 5th edition, John Wiley & Sons, Inc.
- Prasolov, V. (2004) Polynomials, Algorithms and Computation in Mathematics Vol. 11, Springer-Verlag, Berlin.
Cite this paperAPA
Knox, M. L., McDonald, T., & Mitchell, P. (2015). Evaluationally relatively prime polynomials. Notes on Number Theory and Discrete Mathematics, 21(1), 36-41.Chicago
Knox, Michelle L., Terry McDonald, and Patrick Mitchell. “Evaluationally Relatively Prime Polynomials.” Notes on Number Theory and Discrete Mathematics 21, no. 1 (2015): 36-41.MLA
Knox, Michelle L., Terry McDonald, and Patrick Mitchell. “Evaluationally Relatively Prime Polynomials.” Notes on Number Theory and Discrete Mathematics 21.1 (2015): 36-41. Print.