Problem:
Let , . How many ways are there to partition the set into two sets and with size and respectively such that the probability that a number chosen from uniformly at random is greater than a number chosen from uniformly at random is exactly ?
Problem:
Let , . How many ways are there to partition the set into two sets and with size and respectively such that the probability that a number chosen from uniformly at random is greater than a number chosen from uniformly at random is exactly ?
Solution:
, . There are total ways of choosing an element from and , so there must be ways where 's is larger. If we relabel the elements to be , then element is greater than exactly elements in the set. However, we overcount other elements in , so the four elements in must satisfy
To remove the uniqueness condition, we subtract from , from , and from , so we wish to find solutions to . From here, we do casework. If , give solutions, respectively. If , give solutions, respectively. If , give solutions, respectively. If , the only solution is . Thus, the answer is .