If the sequence x1, x2, x3, …, xn, … is such that x1 = 3 and xn+1 = 2xn – 1 for n ≥ 1, then x20 – x19 =
A. 219
B. 220
C. 221
D. 220 - 1
E. 221 - 1
A certain university will select 1 of 7 candidates eligible to fill a position in the mathematics department and 2 of 10 candidates eligible to fill 2 identical positions in the computer science department. If none of the candidates is eligible for a position in both departments, how many different sets of 3 candidates are there to fill the 3 positions?
A. 42
B. 70
C. 140
D. 165
E. 315
|