so, the question is as follows :
find the remainder when $${}^{119}C_{33}$$ is divided by $5$
my approach: well, I don't know about any method except for writing $${}^{119}C_{33} = 264987608114625679810381761543$$ now it is easy to see that the remainder on dividing this by $5$ should be $3$. so,is there a better method to get to the solution? kindly help me out.
note: I saw a similar variation of this question at MSE but it had a special case where in ${}^{n}C_{k} , n! = (n-k)!$ hence I hope this qualifies as a new question.
I agree with Robert Israel's recommendation in the comments to use Lucas's theorem. Here's the computation: \begin{align*} 119_{10} &= 434_5,\\ 33_{10} &= 113_5. \end{align*} Then Lucas tells us that $$\binom{119}{33}\equiv\binom{4}{1}\binom{3}{1}\binom{4}{3}\equiv 4\cdot 3\cdot 4 \equiv 3\pmod{5}.$$