8 people are running for a judge spot. Let's consider them on a case by case basis.
Case 1: 0 judgesFor anything with choosing 0 objects from a total of n objects, there is only going to be one way. Thus, there is only one way to choose no judges:
Case 2: 1 judgeSince we want to choose just one judge, we're going to use the notation C(n, r), which means taking r objects at a time from a sample of n distinct objects.
Case 3: 2 judgesUsing this same logic, we can find how many ways to choose 2, 3, and 4 judges.
Adding all of these up, we get: