Let Fp denote the p-element field for a prime p>3 and let S be the set of functions from Fp to Fp. Find all functions D:S→S satisfying
D(f∘g)=(D(f)∘g)⋅D(g)
for all f,g∈S. Here, ∘ denotes the function composition, so (f∘g)(x) is the function f(g(x)), and ⋅ denotes multiplication, so (f⋅g)=f(x)g(x). algebrafunctional equationnumber theoryfunction