I going to apply to a maths major the coming year and in order to do that, I need to pass the entry test (just so you know my level ain't high).
The question is from a long list of exercises they gave me to get ready for the test:
$Let$ $[n]={1,2,3,....,n}$
How many functions are there from [9] to [7] if every image in the codomain has 3 arguments in the domain? (I translated it from hebrew, I hope I'm correct)
so I thought taking the set $[9]$ and divide it into 3 triplets:
for example:$${(1,2,3),(4,5,6),(7,8,9)}$$ so all possible combinations are $${9 \choose 3}$$
and then I'll try to calculate all possible permutations with $[7]$ which is:
$${9 \choose 3}*\frac{7!}{(7-3)!}$$
I think I made a mistake about how I counted the combinations but I don't have any solutions to check myself (silly I know), is it correct?
Your answer is incorrect.
Strategy: A function is determined by choosing which elements in the domain map to which elements in the codomain. We choose three elements in the codomain to be in the range, then choose which three elements of the domain map to each image in the range.