Define a "digital number" in base b (b > 1) to be a positive integer n such that the base-b digits of n2 add up to n. For example, 9 is a digital number in base 10 because 92 = 81, and 8 + 1 = 9. Also, 9 is a digital number in base 7 because 92 = 81 is written as 144 in base 7, and 1 + 4 + 4 = 9.
There are five other digital numbers in base 7, aside from 9. What are they?
It is not a coincidence that base 7 = 22 + 2 + 1 has unusually many digital numbers. Prove that for all k ≥ 2, there are at least five digital numbers in base k2 + k + 1.
Find all integers b > 1 such that b + 3 is a digital number in base b. (Prove your answer!)
Prove that in any base b ≥ 16, every digital number is less than b3/2. What's the best upper bound you can prove on the largest digital number in base b, when b is large?
Figure 1a shows the 13th stage of a fractal obtained by the following process. The 1st stage is a single black square. The nth stage is obtained by combining two congruent copies of the (n - 1)th stage: one copy is rotated 90° counterclockwise and placed to the right of the other, so that they are aligned along the bottom side. An example of this is shown in Figure 1b.
As n increases, the slope of the diagonal line from the bottom left corner to the top right corner gets closer and closer to some value m. What is m?
In the nth stage, let an be the area of the black region above the diagonal line, and let bn be the area of the black region below the diagonal line.
As n increases, an / bn gets closer and closer to some value a / b. What is a / b?
Marvin is playing a solitaire game with marbles. There are n bowls (for some positive integer n), and initially each bowl contains one marble. Each turn, Marvin may either
remove a marble from a bowl, or
choose a bowl A with at least one marble and a different bowl B with at least as many marbles as bowl A, and move one marble from bowl A to bowl B.
The game ends when there are no marbles left, but Marvin wants to make it last as long as possible.
Prove that the game must end after at most n(n+1)/2 turns.
Prove that for every positive integer k, there is an n such that Marvin can make the n-bowl game last for at least kn turns.
Marisa comes along and asks to join the game. Marvin and Marisa revise the rules: they will alternate taking turns, starting with Marisa. When the game ends, whoever took the last turn is the winner.
Prove that among any three consecutive values of n, there is at least one value for which Marvin has a winning strategy.
An architect is designing a city. The city will be built on the segment of the x-axis from (0,0) to (1,0). Each building is a rectangle whose bottom edge rests on this segment of the x-axis. In the architect's vision, the city has infinitely many buildings: the nth building to be built will have width (1/2)n and height n. Two buildings cannot overlap, but they can share a vertical edge.
The sun rises in the east (in the positive x direction, to the right of the city). A building has a nice view if you can see the sunrise from the top floor: there are no taller buildings to its right blocking the view.
There are also some parks in the city. You may have noticed that the widths of the buildings add up to 1, so there's no room to add parks. Therefore all the parks are very small: just single points on the x-axis. However, parks must still be outdoors: If a building's bottom edge runs from (a,0) to (b,0), we cannot add a park at any point (x,0) for a < x < b.
Suppose that there is a park at the point (1/3, 0). Is it possible to design the city so that every building east of the park has a nice view? Can any buildings west of the park have a nice view?
Suppose that there are two parks: one at (x1, 0) and one at (x2,0), with 0 < x1 < x2 < 1.
For which x1 and x2 is it possible to design such a city? (No nice views are required.)
For which x1 and x2 is it possible to design the city so that every building between the two parks has a nice view?
Show that it's possible to design the city so that no building shares a vertical edge with any other building. Can any buildings in such a city have a nice view—and if so, how many? [NOTE: We have received many questions on the statement of this problem. Please see the FAQ for further clarifications.]
Assaf, Ben, Charlotte, Dan, and Emily are set to appear on the hit reality TV game show Singleton. At the end of each episode, one of the contestants is "voted out of the set" and eliminated from the game. The last contestant remaining wins.
In the voting phase of the episode, each contestant left in the game casts a vote against another contestant still in the game. They vote one at a time, in alphabetical order. The votes are public: when a contestant goes to vote, they are aware of all votes cast so far, and can use that information to inform who they vote against. Once everyone has voted, the contestant that received the most votes is eliminated. If there is a tie, the player who is last alphabetically among those who received the maximum number of votes is eliminated.
It is common knowledge that the contestants all act rationally according to the following priorities:
A contestant's top priority is to avoid elimination for as many episodes as possible (in particular, they would like to win the game if possible).
A contestant wants to eliminate someone in this episode that is as early in the alphabet as possible (without compromising the top priority of lasting as long as they can).
Who gets eliminated in the first episode? Who wins the game?
Suppose the game show begins with an immunity challenge. The winner of the challenge cannot be eliminated in the first episode; nobody is allowed to vote against them. If Dan wins the immunity challenge, who gets voted out? What if Emily wins instead? What if Assaf wins?
Suppose the winner of the immunity challenge is allowed to give their immunity away to another contestant. Does it ever make sense for a contestant to choose to do so?
You are investigating a dangerous cult, with the goal of uncovering its reclusive Mastermind. From previously gathered intelligence, you know that the cult has 100 members: the Mastermind, the Go-between, the Figurehead, and 97 Pawns. Each member of the cult associates with some, but not all, of the other members. In particular:
The Mastermind is very reclusive; they associate with the Go-between, but no other member.
The Go-between associates with the Mastermind and the Figurehead, but none of the Pawns.
The Figurehead associates with everyone except the Mastermind.
The Pawns associate with the Figurehead, but not the Mastermind nor the Go-between. Some pairs of Pawns may also associate with each other (so, each Pawn could potentially have up to 97 total associations).
You cannot figure out which members have special roles just by looking. However, each day, you can select a pair of members to investigate, and determine whether they associate with each other.
Prove that if you investigate all pairs of members, then you can identify the Mastermind.
Is there a strategy to find the Mastermind in under 1000 days?
Suppose there are n members in the cult: one Mastermind, one Go-between, one Figurehead, and n - 3 Pawns. How quickly can you find the Mastermind?
(We don't know the exact answer to (c), but we know some good bounds. Do your best!)
Problem #1 is due to Max Misterka (MC 2021). Problem #4 is due to Conrad Kosowsky (MC 2013–2014). Problems #2, #3, #5, and #6 were written by the Mathcamp staff. Problem #2 first appeared in Mathcamp 2021's weekly Team Problem Solving competition.
Many applicants asked us questions to clarify the statements of Quiz problems via our QQ helpline. Here are some of the questions and our answers; you might find them helpful!
That's fine! For example, if you write 8^2 = 64 in base 13, your digits will be 4 and 12, because 64 = 4*13 + 12. So the sum of the base 13 digits is 4+12 = 16.
For part (a), do we need to show that n(n+1)/2 turns is an achievable maximum (i.e. it is possible to play such that it takes that many turns)?
Nope! We are only asking you to show that the game ends after at mostn(n+1)/2 turns. You could also make a statement like "when n=1, the game will end after at most 2000 turns." This is not a very helpful statement, but it is still true, and it does not imply that it is actually possible to make the game last 2000 turns; it just means the game cannot go for more than 2000 turns.
In part (d), if the widths of the buildings add up to 1, there can't be any gaps between buildings; how can any adjacent buildings *not* share a vertical edge?
You must somehow avoid having adjacent buildings. If this seems impossible, then you are probably reading the problem correctly - but it is possible!
If you're still stuck, solve parts (a) through (c) first. Then ask yourself: is it true that all of the buildings in the cities you've planned share a vertical edge with a building to the left, and with a building to the right? Do your city borders (the points (0,0) and (1,0)) share a vertical edge with a building? If you find a place where the answer is "no", try to leverage that idea to solve part (d).
In part (d), does a park in between two buildings prevent them from sharing a vertical edge?
No. If two buildings both have an endpoint at (x,0) for some x, then they share a vertical edge, even if there is also a park at (x,0).
In 4(b) and 4(c), is the problem asking for a specific x1 and x2 that work, or all possible values of x1 and x2?
You should describe all x1 and x2 that make it possible to design the city, not just a specific example.
Do votes carry over to the next episode, or reset after each episode?
Vote counts reset after each episode. When a voting phase begins, each contestant starts with 0 votes against them, regardless of whether they received votes in previous episodes.
Can a Pawn associate with multiple other Pawns?
Yes! Each pair of Pawns may or may not associate, and this does not depend on any of the other associations between the Pawns.