Prove that a set with n elements has n(n-1)(n-2)/6 subsets containing exactly three elements whenever n is an integer greater than or equal to 3.
Please help, I understand the basics but I am currently stuck on this problem.
Is this a set theory class? If it is then I am wrong.
Otherwise, I stand by what I have written.