I have to prove that the binomial coefficent $\binom{2p}{p} $ is $\equiv 2\pmod{p}$ using group actions.
I've tried with an action of $ C_p \times C_p$ upon the set of all numbers between $1$ and $2p$ but I'm blocked here.
P.s. here $C_p$ is the cyclic group of order p
Answer that lacks the application of group actions (so it might be useless for you).
For a proof of: $$\binom{2p}{p}=\sum_{k=0}^p\binom{p}{k}^2=2+\sum_{k=1}^{p-1}\binom{p}{k}^2$$
have a look here.
Evidendly prime $p$ divides $\binom{p}{k}$ for each $k\in\{1,\dots,p-1\}$.
I don't know, but maybe some action can be found on a set of cardinality $\binom{2p}{p}$ that is split up in orbits of sizes $\binom{p}{k}^2$