Evaluationally coprime linear polynomials

MaRDI QIDQ2830428zbMATH OpenFDO

Authors Randell Heyman

Publication date 28 October 2016

Published in Integers (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1603.06630, http://www.emis.de/journals/INTEGERS/papers/q65/q65.Abstract.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

evaluationally coprimeGCD algorithm

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Polynomials in number theory (11C08)

Abstract: Two polynomials, $f,ginmathbbZ[x]$ are evaluationally coprime at x if $gcd(f(x),g(x))=1$. We give necessary and sufficient conditions for two such linear polynomials to have a positive proportion of evaluated coprime values.

Recommendations

• Evaluationally relatively prime polynomials
• A coprimality condition on consecutive values of polynomials
• Bézout's identity for cyclotomic polynomials over the integers
• Prime and coprime values of polynomials
• scientific article; zbMATH DE number 434828

Cited in

(3)

• Evaluationally relatively prime polynomials
• Bézout's identity for cyclotomic polynomials over the integers
• A coprimality condition on consecutive values of polynomials

This page was built for publication: Evaluationally coprime linear polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830428)