We have to find the numerical value of the finite sum
∑r=02050−rC6.
The upper index of the combination depends on r, so first we replace that dependent index by a single symbol that increases in the usual (left-to-right) direction. Put
k=50−r.
When r=0, we obtain k=50, and when r=20, we obtain k=30. As r runs from 0 to 20, k therefore runs from 50 down to 30. Because addition is commutative, the order does not matter, so we may rewrite the sum as
∑r=02050−rC6=∑k=3050kC6.
Now we recall a standard combinatorial identity, usually proved by induction or by Pascal’s rule:
∑k=mnkCm=n+1Cm+1for integers n≥m≥0.
In our case m=6, so if the lower limit were 6 instead of 30, we could apply the identity directly. We therefore write the desired sum as the difference of two larger sums whose lower limit is 6:
∑k=3050kC6=(∑k=650kC6)−(∑k=629kC6).
By the quoted identity, we evaluate each parenthesis separately.
First parenthesis (upper limit 50):
∑k=650kC6=50+1C6+1=51C7.
Second parenthesis (upper limit 29):
∑k=629kC6=29+1C6+1=30C7.
Substituting these two evaluations back, we get
∑k=3050kC6=51C7−30C7.
Hence, the original sum equals 51C7−30C7, which coincides with Option A.
Hence, the correct answer is Option A.