Given S={1,2,…,10} and f:S→S defined by:
f(n)={2n2n−11if n=1,2,3,4,5if n=6,7,8,9,10
So: f(1)=2,f(2)=4,f(3)=6,f(4)=8,f(5)=10,f(6)=1,f(7)=3,f(8)=5,f(9)=7,f(10)=9
Note that f is a bijection. Its inverse is:
f−1(k)={k/2(k+11)/2if k is evenif k is odd
We need g:S→S such that f∘g(n)={n+1n−1if n is oddif n is even
Since f is bijective: g(n)=f−1(f∘g(n)).
Computing each value:
g(1)=f−1(2)=1,g(2)=f−1(1)=6,g(3)=f−1(4)=2
g(4)=f−1(3)=7,g(5)=f−1(6)=3
g(6)=f−1(5)=8,g(7)=f−1(8)=4,g(8)=f−1(7)=9
g(9)=f−1(10)=5,g(10)=f−1(9)=10
Now compute:
g(1)+g(2)+g(3)+g(4)+g(5)=1+6+2+7+3=19
g(10)=10
g(10)⋅(g(1)+g(2)+g(3)+g(4)+g(5))=10×19=190
The correct answer is 190.