So it’s math again. You need to brush up a bit on your permutation skills. Let’s start right now: according to Andre’s theorem, what is the exponential generating function of the numbers En, where En is the number of alternating permutations of the set {1, 2, 3, …, n} and the first several numbers are E0=1, E1=1, E2=1, E3=2, E4=5, E5=16, E6=61, E7= 272?

What is the solution to the Josephus problem? What are the Langford pairing in the sequence 1, 1, 2, 2, …, n, n, if 2000000002 is the value of n? Are you still here with me? Regardless of your answer, look this one up! It’s one hot topic!

Of the films Empty Set Studios released last year, 60% were comedies and the rest were horror films. 75% of the comedies were profitable, but 75% of the horror moves were unprofitable. If the studio made a total of 40 films, and broke even on none of them, how many of their films were profitable?