Explanation
To solve this problem, we need to count the number of injective functions f that map even numbers in the domain to even numbers in the codomain.
Step 1: Identify the elements
Domain: {1,2,3,4}
Even numbers in Domain (Deven): {2,4} (Total: 2)
Odd numbers in Domain (Dodd): {1,3} (Total: 2)
Codomain: {1,2,3,4,5,6,7,8}
Even numbers in Codomain (Ceven): {2,4,6,8} (Total: 4)
Odd numbers in Codomain (Codd): {1,3,5,7} (Total: 4)
Step 2: Calculate mappings
Mapping even numbers: We must map the 2 even numbers from the domain to the 4 even numbers in the codomain. Since the function must be injective, the number of ways is given by the permutation P(4,2):
P(4,2)=4×3=12
Mapping odd numbers: We have 2 odd numbers remaining in the domain. We have already used 2 numbers from the codomain for the even mappings. Therefore, the remaining number of available elements in the codomain is 8−2=6. The number of ways to map the 2 odd numbers into the 6 available slots is given by P(6,2):
P(6,2)=6×5=30
Total injective functions (n):
n=12×30=360
Step 3: Prime Factorization
Now, we express n in the form 2a3b5c:
360=36×10
360=(22×32)×(21×51)
360=22+1×32×51
n=23×32×51
By comparing n=2a3b5c with 23×32×51, we get:
Final Step: Calculate a+b+c
a+b+c=3+2+1=6
Correct Option: 2. 6