Skip to content
Q33Section DA (Data Science and Artificial Intelligence (Q11–Q65))33 of 65

Number of self-inverse permutations (involutions) of 4 elements

The number of bijections f(⋅)f(\cdot) from the set S={1,2,3,4}S = \{1, 2, 3, 4\} to itself such that f(f(n))=nf(f(n)) = n, for all n∈Sn \in S, is __________ . (Answer in integer)

Numerical answer: type the number (no options).

Type your answer and check it.