Problem Set 28
Online Math Club
April 17, 2025
Introduction
This problem set contains problems based on Pathological FEs and Global/Local tech-
niques in Combinatorics.
Instructions:
• You can discuss the problems with one another and come up with solutions together
as well. This is especially encouraged for harder problems. We would request you
to solve the easier ones independently.
• You are also encouraged to ask for hints on the server on problems you’re struggling
with.
• The solutions/sources of the problems will be posted with the next Pset.
• Problems are roughly ordered by difficulty.
• Enjoy the problems!
1
Online Math Club Problem Set 28
§1 Problems
Problem 1.1. Find all functions f : [−1, 1] → R, which satisfy
f (sin x) + f (cos x) = 2020
for any real number x.
Problem 1.2. Let N denote the set of all positive integers. Find all real numbers c for
which there exists a function f : N → N satisfying:
f (x+a)−f (x)
• for any x, a ∈ N, the quantity a is an integer if and only if a = 1;
• for all x ∈ N, we have |f (x) − cx| < 2023.
Problem 1.3. Determine all strictly increasing functions f : N → N satisfying nf (f (n)) =
f (n)2 for all positive integers n.
Problem 1.4. You are given a set of n blocks, each weighing at least 1; their total
weight is 2n. Prove that for every real number r with 0 ≤ r ≤ 2n − 2 you can choose a
subset of the blocks whose total weight is at least r but at most r + 2.
Problem 1.5. A staircase-brick with 3 steps of width 2 is made of 12 unit cubes.
Determine all integers for which it is possible to build a cube of side using such bricks.
Problem 1.6. On a flat plane in Camelot, King Arthur builds a labyrinth L consisting
of n walls, each of which is an infinite straight line. No two walls are parallel, and no
three walls have a common point. Merlin then paints one side of each wall entirely red
and the other side entirely blue.
At the intersection of two walls there are four corners: two diagonally opposite corners
where a red side and a blue side meet, one corner where two red sides meet, and one
corner where two blue sides meet. At each such intersection, there is a two-way door
connecting the two diagonally opposite corners at which sides of different colours meet.
After Merlin paints the walls, Morgana then places some knights in the labyrinth. The
knights can walk through doors, but cannot walk through walls.
Let k(L) be the largest number k such that, no matter how Merlin paints the labyrinth
L, Morgana can always place at least k knights such that no two of them can ever meet.
For each n, what are all possible values for k(L), where L is a labyrinth with n walls?
Problem 1.7. Let n points be given inside a rectangle R such that no two of them lie
on a line parallel to one of the sides of R. The rectangle R is to be dissected into smaller
rectangles with sides parallel to the sides of R in such a way that none of these rectangles
contains any of the given points in its interior. Prove that we have to dissect R into at
least n + 1 smaller rectangles.
Problem 1.8. For each positive integer n, the Bank of Cape Town issues coins of
denomination n1 . Given a finite collection of such coins (of not necessarily different
denominations) with total value at most most 99 + 12 , prove that it is possible to split
this collection into 100 or fewer groups, such that each group has total value at most 1.
2
Online Math Club Problem Set 28
§2 Solutions/Sources to PSet 27
Problem 2.1. 2005 G6
Problem 2.2. 2015 Taiwan TST Round 3 Quiz 3 P2
Problem 2.3. 2013 APMO/5
Problem 2.4. 2019 IGO P3
Problem 2.5. USAMO 2018/5
Problem 2.6. [Link]
Problem 2.7. APMO 2008/3
Problem 2.8. Sharygin 2017 9.8
Problem 2.9. Sharygin Correspondence Round 2024 P11
Problem 2.10. CGMO 2017 P7
Problem 2.11. Serbia 2017/6
Problem 2.12. Sketch: Rephrase the problem in terms of involution pairs. Solve this
”involution” problem on a circle and then project on a suitable line