Let S = 1, 2, 3, 4, 5, 6, 7. Then the number of possible functions f: S → S such that f(m. n) = f(m). f(n) for every m, n S and m. n S is equal to _ _ _ _ _ _ _.

Sets, Relations and Functions: JEE Main 2021 Mathematics question

JEE Main 2021 · 27 Jul, Morning shift · Q39

JEE Main 202127 Jul, Morning shiftMathematicsMediumSets, Relations and Functions168× since 2002

Let S = {1, 2, 3, 4, 5, 6, 7}. Then the number of possible functions f : S

\to

S such that f(m . n) = f(m) . f(n) for every m, n

\in

S and m . n

\in

S is equal to _____________.

Your answerType your answer. Integers and decimals are accepted.