Home Competitions US-TST 2016 Problem 3
Let p p p be a prime number. Let F p \mathbb{F}_{p} F p denote the integers modulo p p p , and let F p [ x ] \mathbb{F}_{p}[x] F p [ x ] be the set of polynomials with coefficients in F p \mathbb{F}_{p} F p . Define Ψ : F p [ x ] → F p [ x ] \Psi: \mathbb{F}_{p}[x] \rightarrow \mathbb{F}_{p}[x] Ψ : F p [ x ] → F p [ x ] by Ψ ( ∑ i = 0 n a i x i ) = ∑ i = 0 n a i x x i . \Psi\left(\sum_{i=0}^{n} a_{i} x^{i}\right)=\sum_{i=0}^{n} a_{i} x^{x^{i}} . Ψ ( i = 0 ∑ n a i x i ) = i = 0 ∑ n a i x x i . Prove that for nonzero polynomials F , G ∈ F p [ x ] F, G \in \mathbb{F}_{p}[x] F , G ∈ F p [ x ] , Ψ ( gcd ( F , G ) ) = gcd ( Ψ ( F ) , Ψ ( G ) ) \Psi(\operatorname{gcd}(F, G))=\operatorname{gcd}(\Psi(F), \Psi(G)) Ψ ( gcd ( F , G )) = gcd ( Ψ ( F ) , Ψ ( 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
Similar problems
These problems have the most words in common with this statement.
Locator us-tst/2016/p3 · Tag VAJXFZHV8J · Edit this page on GitHub · Keys: j next, k previous