This is a variation of the problem in the link below, while the original assumed that you could put more than one rings on one finger. I was wondering if we were to have 8 different types of rings and 3 fingers, how many ways can the rings be placed on the fingers if there are no more than 1 ring per finger?
I have a proposed idea on how to solve this problem though I doubt if my approach is correct. Unlike the original problem, the stars and bars method won't work. We have to make the problem divided into mutually exclusive cases, and I was thinking of doing the following:
Case 1: 1 ring ${8 \choose 1}{3 \choose 1}$
Case 2: 2 rings ${8 \choose 2}{3 \choose 2}$
Case 3: 3 rings: ${8 \choose 3}3!$
But my real trouble was not the ${8 \choose x}$, where $x$ is the number of rings, rather it was ${3 \choose y}$ where $y$ is the number of fingers. To clarify, I have doubts because I was wondering that I was going to have to multiply by $3!$ for every single one instead because there were 6 ways of arranging three fingers?