aConsider n basketball teams Assume that every pair of teams

a)Consider n basketball teams. Assume that every pair of teams play each other exactly once (Note: there are no draws in basketball). How many possible different results there are for this process?

b)Let the teams be 1, 2...., n. Let x(i) be the number of games team i in the order won. Show that (x(i)) = (n choose 2).

c)Show that there is an i so that x(i) >= (n-1)/2

Solution

a)

n C 2

we cant no say a number exactly because we dont know how many basketball teams are exactly

for the other literals

I can gladly help you but you should post it in a new question