A snail crawls up a vertical pole 75 feet high, starting from the ground. Each day it crawls up 5 feet, and each night it slides down 4 feet. When will it first reach the top of the pole?

We would like to invite a minimum number n of people (their birthdays are independent of each other) to a party such that the expected number of pairs of people that share the same birthday is at least 1. What should n be?
(Ignore leap years, so there are only 365 possible birthdays. Assume that birthdays fall with equal probability on each of the 365 days of the year.)

A binary string is a sequence of 0’s and 1’s. A binary string is finite if the sequence is finite, otherwise it is infinite. Examples of finite binary strings include 00010100, and 1111101010. Which of the following is TRUE about the set of all finite binary strings and the set of all infinite binary strings?

Consider the polynomial p(x) = x³ − x² + x − 1. How many symmetric matrices with integer entries are there whose characteristic polynomial is p? (Recall that the characteristic polynomial of a square matrix A in the variable x is defined to be the determinant of the matrix (A − x^I) where I is the identity matrix.)

Let F be the set of all functions mapping {1, . . . , n} to {1, . . . ,m}. Let f be a function that is chosen uniformly at random from F. Let x, y be distinct elements from the set {1, . . . , n}. Let p denote the probability that f(x) = f(y). Then,

Let f be a polynomial of degree n ≥ 3 all of whose roots are non-positive real numbers. Suppose that f(1) = 1. What is the maximum possible value of f′(1)?

Initially, N white beads are arranged in a circle. A number k is chosen uniformly at random from {1, . . . ,N − 1}. Then a set of k beads is chosen uniformly from the white beads, and these k beads are coloured black. The position of the beads remains unchanged. What is the probability that the black beads occur sequentially in the circle, i.e., at most two black beads have white beads next to them?

Let A be the (n + 1) × (n + 1) matrix given below, where n ≥ 1. For i ≤ n, the i-th row of A has every entry equal to 2i − 1 and the last row, i.e., the (n + 1)-th row of A has every entry equal to −n².

Which of the following statements is TRUE for all n ≥ 1?

You are given the following properties of sets A, B, X, and Y . For notation, |A| denotes the cardinality of set A (i.e., the number of elements in A), and A \ B denotes the set of elements that are in A but not in B.
1. A ∪ B = X ∪ Y
2. A ∩ B = X ∩ Y = ∅
3. |Y \ A| = 2
4. |A \ X| = 4
Which of the following statements MUST then be FALSE?

Consider a bag containing colored marbles. There are n marbles in the bag such that there is exactly one pair of marbles of color i for each i ∈ {1, . . . ,m} and the rest of the marbles are of distinct colors (different from colors {1, . . . ,m}). You draw two marbles uniformly at random (without replacement). What is the probability that both marbles are of same color?

Let X be a finite set. A family F of subsets of X is said to be upward closed if the following holds for all sets A,B ⊆ X:
A ∈ F and A ⊆ B ⇒ B ∈ F.
For families F and G of subsets of X, let
F ⊔ G = {A ∪ B : A ∈ F and B ∈ G}.
Suppose F and G are upward closed families. Then which of the following is true?