Hello I am studying for my exam and there's a question that i don't know how to solve, I have some difficulties with symmetric/permutations groups 1. The problem statement, all variables and given/known data Consider a finite group of order > 2. We write Aut(G) for the group of automorphisms of G and Sg for the permutations group of the set G. Consider a1 and a2 ∈ Aut(G) two automorphisms. We suppose that the g=1 is the only element g ∈ G such as ∀ x ∈ G we have a1(g)*x=x*a2(g) For g,x ∈ G we have fg(x):=a1(g)*x*a2(g-1) Show that for each g ∈ G the application fg: G→G is in Sg 2. Relevant equations 3. The attempt at a solution I really dont know how to do that..