The 2025 Quiz Problems

Don't forget to start with the instructions. (In particular, a reminder: your solutions must be entirely your own work, and you may not consult with others. Do not ever post these problems in online forums, or ask others how to solve them. Do not use AI tools to help solve the problems or write your solutions.) Good luck and have fun!

You may be interested in the printable (PDF) format or the LaTeX source code. And perhaps the LaTeX Sample File for Solutions. You can also find all these files, plus all the images necessary to compile the .tex files, in this zip file.

  1. A number is a palindrome if it reads the same backwards and forwards. For instance, 14541 is a palindrome, whereas 321 and 6560 are not. (Note that you can't write 6560 as 06560 to make it into a palindrome: zero is not a valid leading digit.)

    Is it possible to write 2025 as a ratio of two palindromes? What about 2026?

  2. Angela has just landed in the city of Metropolis. Her plan is to take the subway from the Airport station to the Museum station. Angela knows the following facts about the Metropolis subway system:

    • It has 15 lines, all of which are straight.
    • Every pair of subway lines intersects. Where they meet, there's an interchange station where you can switch from one line to the other.
    • Each station is the interchange station between exactly two different lines. (No three lines meet at the same station.)
    • A ride of n stops costs n subway tokens. (So if A and B are consecutive stations, riding between them costs one token.) Switching lines doesn't cost extra.

    Unfortunately, Angela forgot to look up how far the Museum station is from the Airport station, and she has to buy tokens before she can consult a subway map.

    1. What is the smallest number of tokens Angela can buy to guarantee that she can get from the airport to the museum? (She'll have access to a map once she buys the tokens, so she'll be able to take the actual cheapest route.)
    2. Extra credit: What if Angela cannot assume that all the subway lines are straight? (We do not have a complete answer to this question, but we're curious what you can come up with.)

  3. This problem is about perfect binary trees. The first few examples of perfect binary trees are shown below.

    image: the first few examples of perfect binary trees

    In general, a perfect binary tree of height n consists of n+1 rows of nodes (which are depicted as circles in the above figure). The top row has one node, called the root, and each subsequent row has twice as many nodes as the previous row. The 2n nodes in the bottom row are called the leaves. Each node except the root is connected by an edge to one node in the row above it, and each node that is not a leaf is connected by an edge to two nodes in the row below it.

    We can shuffle a perfect binary tree by deciding, for each non-leaf node, whether to switch the left and right branches coming out of that node. For example, in the diagram below, the tree on the right can be obtained from the tree on the left via a shuffle in which we switch the left and right branches from the nodes marked in red.

    image: an example of shuffling a perfect binary tree

    Suppose the leaves of our tree are labeled with some permutation of the numbers 1 to 2n, and we shuffle the tree to get as many leaf nodes as possible into the "correct" position (where the node's label corresponds to the node's number starting from the left). For example, our diagram shows that if n=3 and the starting permutation is 56873421, we can get all the leaf nodes into the correct position by shuffling. On the other hand, if the starting permutation is 18234567, we can't get all the leaf nodes into the correct position, since 1 and 8 would still be neighbors under any shuffle.

    In the worst case scenario, for a perfect binary tree of height n, how many of the 2n leaf nodes can you get into the correct position by shuffling? (Note: If your answer is X, then you need to prove two things: (1) for any starting permutation, you can always get at least X nodes into the correct position by shuffling; (2) there are starting permutations for which you cannot get more than X nodes into the correct position by shuffling.)

  4. A crescent is a pentagon with five sides of equal length and internal angles 108°-36°-252°-36°-108°. This is just like a regular pentagon, but with one of the corners "caved in":

    image: a crescent

    1. Show that it is possible to make a 12-sided polyhedron each of whose faces is a crescent.

      (You might find it helpful and/or fun to make a paper model; if so, we'd love to see a photo! However, a model is not a proof: you still need to show that all the lengths and angles work out precisely. One way to do this is to specify the coordinates of the vertices, and then check everything that needs to be checked. We suggest centering your polyhedron at (0,0,0) to take advantage of symmetry.)

    2. A net for a polyhedron is a connected arrangement of polygons in the plane that can be folded along a subset of the edges to create the polyhedron. For example, here are a few possible nets for a cube:

      image: several possible cube nets

      Is it possible to make a net for the polyhedron that you constructed in part (a)? Keep in mind that the twelve crescents forming the net are not allowed to overlap (except at the edges).

  5. The state of Infiana is an infinite plane of farmland, subdivided into an infinite square grid of 1 km × 1 km plots of land. A finite number of farmers (at least two) each own infinite territory in Infiana, with each 1×1 plot belonging to exactly one farmer. The plots that each farmer owns are connected by orthogonal adjacency; in other words, any two points belonging to the same farmer can be connected by a road that lies within that farmer's territory and that does not pass through a vertex of a 1×1 plot along the way.

    A farmer may split their territory into two fields by building a fence along the gridlines, all within their own territory. The laws of Infiana dictate that the fence must be of finite length, but the resulting fields must still have infinite area. Each field can then be further subdivided into more fields.

    1. For each positive integer n, give an example of a territory that can be split into n pieces but no more.
    2. Prove that no territory can be broken up into infinitely many pieces.
    3. Prove that there are always at least two farmers who cannot split their territory at all.

  6. The Hilbert Curve is a famous example of a space-filling curve. (You can read all about it on Wikipedia, though you don't need any of that information to solve this problem.) Inspired by the Hilbert curve, Misha decides to build an infinite running track of the same shape. Instead of making the segments smaller and smaller so that the whole thing fits inside a 1×1 square, he makes all the segments 1 meter long and allows the track to extend over the entire first quadrant of the plane.

    The track is constructed in stages, as follows:

    • The initial stage H0 starts at (0,0) and covers the bottom left 1×1 square of the first quadrant. It consists of three segments in a U-shape:
      image: the initial stage H_0
    • For each positive integer n, the stage Hn starts at (0,0) and covers the bottom left (2n+1-1)×(2n+1-1) square of the first quadrant. It begins with Hn-1, then continues with three rotated or reflected copies of Hn-1 joined together with line segments of length 1, as shown below:
      image: building H_n

    Note that the procedures for constructing Hn for even and odd n are essentially the same. We display them separately to emphasize that when n is odd, the construction results in Hn appearing sideways (reflected about the line y = x).

    The first few stages of the construction are shown below:
    (Image from https://www.designcoding.net/hilbert-curve/.)

    image: the first few stages of construction

    General hint for this problem: it helps to write all distances along the running track in base 4.

    1. Warm-up: how long is Hn?
    2. How far along the track does a runner travel to get to the point (n,n)? (Hint: try it first for n = 2k.)
    3. One interesting feature of this running track is that you sometimes pass within a 1-meter distance of points that are very far ahead of you along the track — or very far behind! Suppose Anna, Benny, and Charlotte all start from (0,0) at the same time. Anna strolls at 1 m/s, Benny walks at 2 m/s, and Charlotte jogs at 3 m/s. Which pair(s) of them will pass within 1 meter of each other infinitely often? (Provide a proof both for the pairs that do and for the pairs that don't!)
    4. Della and Ellie each take a stroll along the running track at a speed of 1 m/s. Ellie starts k seconds after Della, where k is a positive odd integer. Show that there is some value of k such that Della and Ellie never pass within 1 meter of each other.

Problems 1, 2, and 5 are by Benny Wang (MC'24). Problem 3 is by Anna C. (MC'23). Problems 4 and 6 are by Misha Lavrov (Mathcamp staff).