7 Replies
@Apu
Note for OP
+solved @user1 @user2... to close the thread when your doubt is solved. Mention the users who helped you solve the doubt. This will be added to their stats.The total number of functions from f to g are 3!. The number of functions where f is not equal to g for any x belonging to 1,2,3 is D_3. So, the required value is 3!-D3=6-2=4.
9 hai answer
Oh sorry mb.
The number of functions from {1,2,3} to itself is 3^3=27. Now, consider x=1, for f(1) is not equal to 1 we have two choices for g(1). Similarly for f(2) and f(3). So the total undesirable cases are 2^3=8
Hence the desirable cases by bijection are 27-8=19
ahhh makes sense
thanks
+solved @SirLancelotDuLac
Post locked and archived successfully!
Archived by
<@964432960197632059> (964432960197632059)
Time
<t:1746677664:R>
Solved by
<@1075951732460376214> (1075951732460376214)