1 problem

Matching
  • Let n,m∈Zn,m\in\mathbb{Z} and A,B∈Z∖{0}A,B\in\mathbb{Z}\setminus\{0\} satisfy 1≤m<n1\le m<n and gcd⁡(n,mB)=1\gcd(n,mB)=1. Suppose that f(X)=Xn+A(BX+1)m∈Z[X]f(X)=X^n+A(BX+1)^m\in\mathbb{Z}[X] is irreducible, let α\alpha be…