I was thinking of the following problem related to discrete math. Assume that we have n teams scheduled for a round robin tournament. For any given round in the tournament, how many possible win-loss outcomes are there?
For example, if we have the following teams: A B C D, then we have 12 possible outcomes for a given round:
A defeats B, C defeats D
A defeats B, D defeats C
A defeats C, B defeats D
A defeats C, D defeats B
B defeats A, C defeats D
B defeats A, D defeats C
B defeats C, A defeats D
B defeats C, D defeats A
C defeats A, B defeats D
C defeats A, D defeats B
C defeats B, D defeats A
C defeats B, A defeats D
I would like a to find this number as a function of n.