Answer:
In 105 different ways
Explanation:
To solve this problem we will use combinations without repetitions.
C(n k) = V(n k) / k!
In this case n = 15 and k = 2
C(15 2) = V(15 2) / 2! = 15 · 14 / 2 = 15 · 7 = 105
The two captains can be selected in the 105 different ways (combinations).
God with you!!!