olymmath

US-TST 2016 Problem 3

    Let pp be a prime number. Let Fp\mathbb{F}_{p} denote the integers modulo pp, and let Fp[x]\mathbb{F}_{p}[x] be the set of polynomials with coefficients in Fp\mathbb{F}_{p}. Define Ψ:Fp[x]→Fp[x]\Psi: \mathbb{F}_{p}[x] \rightarrow \mathbb{F}_{p}[x] by Ψ(∑i=0naixi)=∑i=0naixxi.\Psi\left(\sum_{i=0}^{n} a_{i} x^{i}\right)=\sum_{i=0}^{n} a_{i} x^{x^{i}} . Prove that for nonzero polynomials F,G∈Fp[x]F, G \in \mathbb{F}_{p}[x], Ψ(gcd⁡(F,G))=gcd⁡(Ψ(F),Ψ(G))\Psi(\operatorname{gcd}(F, G))=\operatorname{gcd}(\Psi(F), \Psi(G))

    Dataset text NuminaMath olympiads. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Locator us-tst/2016/p3 · Tag VAJXFZHV8J · Edit this page on GitHub · Keys: j next, k previous