Related papers: Evaluationally coprime linear polynomials

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

We show that for any polynomial $f: \mathbb{Z}\to \mathbb{Z}$ with positive leading coefficient and irreducible over $\mathbb{Q}$, if $N$ is large enough then there are two strings of consecutive positive integers $I_{1}=\{n_1-m,\ldots,…

Let $R$ be a commutative ring, $f \in R[X_1,\ldots,X_k]$ a multivariate polynomial, and $G$ a finite subgroup of the group of units of $R$ satisfying a certain constraint, which always holds if $R$ is a field. Then, we evaluate $\sum…

Let $k\in\mathbb{N}$. Let $f(x)\in \Bbb{Z}[x]$ be any polynomial such that $f(x)$ and $f(x+1)f(x+2)... f(x+k)$ are coprime in $\mathbb{Q}[x]$. We call $$g_{k,f}(n):=\frac{|f(n)f(n+1)... f(n+k)|}{\text{lcm}(f(n),f(n+1),...,f(n+k))}$$ a Farhi…

In this paper we consider generalized monomial functions $f, g\colon \mathbb{F}\to \mathbb{C}$ (of possibly different degree) that also fulfill \[ f(P(x))= Q(g(x)) \qquad \left(x\in \mathbb{F}\right), \] where $P\in \mathbb{F}[x]$ and $Q\in…

For coprime nonzero integers $a$ and $b$, a positive integer $\ell$ is said to be {\em good} with respect to $a$ and $b$ if there exists a positive integer $k$ such that $\ell |(a^{k}+b^{k})$. Since the early 1990s, such classical good…

We consider a few modifications of the Big prime modular $\gcd$ algorithm for polynomials in $\Z[x]$. Our modifications are based on bounds of degrees of modular common divisors of polynomials, on estimates of the number of prime divisors…

Let E be a compact set of C of positive logarithmic capacity. Let us suppose that for every polynomial $P\not=id$ we have $P^{-1}(E)\not=E$. Then for all no constant polynomials f and g such that $f^{-1}(E)=g^{-1}(E)$ we have f=g.

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The…

We consider polynomials of the form t^n-1 and determine when members of this family have a divisor of every degree in Z[t]. With F(x) defined to be the number of such integers up to x, we prove the existence of two positive constants c_1…

We find all polynomials f,g,h over a field K such that g and h are linear and f(g(x))=h(f(x)). We also solve the same problem for rational functions f,g,h, in case the field K is algebraically closed.

Let $a(\lambda)$ and $b(\lambda)$ be two polynomials with coefficients in complex numbers and let $f_{\lamb$ be a one-parameter family of polynomials indexed by all complex numbers $\lambda$. We study whether there exist infinitely many…

We describe how to compute for two polynomials $f(X), g(X) \in \mathbb{Z}[X]$ with integer coefficients the greatest common divisors of $f(z)$ and $g(z)$ for all integers $z \in \mathbb{Z}$. As an application we determine the structures…

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. In order to count the decomposables, one wants to know, under a suitable normalization, the number of equal-degree collisions of…

This note investigates the prime values of the polynomial $f(t)=qt^2+a$ for any fixed pair of relatively prime integers $ a\geq 1$ and $ q\geq 1$ of opposite parity. For a large number $x\geq1$, an asymptotic result of the form $\sum_{n\leq…

Goppa codes are particularly appealing for cryptographic applications. Every improvement of our knowledge of Goppa codes is of particular interest. In this paper, we present a sufficient and necessary condition for an irreducible monic…

Let $f,g_1,\dots,g_m$ be polynomials of degree at most $d$ with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Assume that $f$ is non-negative on a basic semi-algebraic set $S$ defined by polynomial inequalities $g_j(x)\ge…

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Let k be an algebraically closed field. A polynomial F in k[X,Y] is said to be "generally rational" if, for almost all c in k, the curve " F= c '' is rational. It is well known that, if char(k)=0, F is generally rational iff there exists G…