Problems

There are infinitely many couples at a party. Each pair is separated to form two queues of people, where each person is standing next to their partner. Suppose the queue on the left has the property that every nonempty collection of people has a person (from the collection) standing in front of everyone else from that collection. A jester comes into the room and joins the right queue at the back after the two queues are formed.

Each person in the right queue would like to shake hand with a person in the left queue. However, no two of them would like to shake hand with the same person in the left queue. If $p$ is standing behind $q$ in the right queue, $p$ will only shake hand with someone standing behind $q$’s handshake partner. Show that it is impossible to shake hands without leaving out someone from the left queue.

Suppose $x,y$ are real numbers such that $x<y+\epsilon$ for every $\epsilon >0$. Show that $x\le y$.

What is logically the opposite of the statement “every $n$ is odd or $p<q$"?

Four different digits are given. We use each of them exactly once to construct the largest possible four-digit number. We also use each of them exactly once to construct the smallest possible four-digit number which does not start with 0. If the sum of these two numbers is 10477, what are the given digits?

The picture below shows a closed disc, which is just a circle with the inside filled. The grey interior represents the interior of the disc. Describe the resulting shape when you glue the circular boundary to one point.

Label the vertices of a cube with the numbers $1,2,3,\dots ,8$ so that the sum of the labels of the four vertices of each of the six faces is the same.

Is it possible to construct a 485 × 6 table with the integers from 1 to 2910 such that the sum of the 6 numbers in each row is constant, and the sum of the 485 numbers in each column is also constant?

How many ways can the numbers $1,1,1,1,1,2,3,\dots ,9$ be listed in such a way that none of the $1$’s are adjacent? The number 1 appears five times and each of $2$ to $9$ appear exactly once.

John’s local grocery store sells 7 kinds of vegetable, 7 kinds of meat, 7 kinds of grains and 7 kinds of cheese. John would like to plan the entire week’s dinners so that exactly one ingredient of each type is used per meal and no ingredients repeat during the week. How many ways can John plan the dinners?

Suppose there is an $7\times 7$ grid. We would like to travel from the bottom left corner to the top right corner in exactly 14 steps. A step is from one point on the grid to another point via a segment of length 1. How many paths are there? The picture below shows one possible path on the grid.