Let A=1,2,3,5,8,9. Then the number of possible functions f:A→A such that f(m⋅n)=f(m)⋅f(n) for every m,n∈A with m⋅n∈A is equal to \_\_\_\_\_\_\_\_\_\_\_.
Answer: 432
Solutions · 1
Official solution
f(1.n)=f(1).f(n)⇒f(1)=1.
f(3.3)=(f(3))2
Hence, the possibilities for (t(3),(9)) are (1,1) and (3,9).
Other three i.e. f(2),f(5),f(8)
Can be chosen in 63 ways.
Hence, total number of functions
63×2=432