MathDB
2016 Math Hour Olympiad - University of Washington - Grades 8-10

Source:

March 4, 2022
algebrageometrycombinatoricsnumber theoryMath Hour Olympiad

Problem Statement

Round 1
p1. Alice and Bob compiled a list of movies that exactly one of them saw, then Cindy and Dale did the same. To their surprise, these two lists were identical. Prove that if Alice and Cindy list all movies that exactly one of them saw, this list will be identical to the one for Bob and Dale.
p2. Several whole rounds of cheese were stored in a pantry. One night some rats sneaked in and consumed 1010 of the rounds, each rat eating an equal portion. Some were satisfied, but 77 greedy rats returned the next night to finish the remaining rounds. Their portions on the second night happened to be half as large as on the first night. How many rounds of cheese were initially in the pantry?
p3. You have 100100 pancakes, one with a single blueberry, one with two blueberries, one with three blueberries, and so on. The pancakes are stacked in a random order. Count the number of blueberries in the top pancake, and call that number N. Pick up the stack of the top N pancakes, and flip it upside down. Prove that if you repeat this counting-and-flipping process, the pancake with one blueberry will eventually end up at the top of the stack.
p4. There are two lemonade stands along the 44-mile-long circular road that surrounds Sour Lake. 100100 children live in houses along the road. Every day, each child buys a glass of lemonade from the stand that is closest to her house, as long as she does not have to walk more than one mile along the road to get there. A stand's advantage is the difference between the number of glasses it sells and the number of glasses its competitor sells. The stands are positioned such that neither stand can increase its advantage by moving to a new location, if the other stand stays still. What is the maximum number of kids who can't buy lemonade (because both stands are too far away)?
p5. Merlin uses several spells to move around his 6464-room castle. When Merlin casts a spell in a room, he ends up in a different room of the castle. Where he ends up only depends on the room where he cast the spell and which spell he cast. The castle has the following magic property: if a sequence of spells brings Merlin from some room AA back to room AA, then from any other room BB in the castle, that same sequence brings Merlin back to room BB. Prove that there are two different rooms XX and YY and a sequence of spells that both takes Merlin from XX to YY and from YY to XX.
Round 2
p6. Captains Hook, Line, and Sinker are deciding where to hide their treasure. It is currently buried at the XX in the map below, near the lairs of the three pirates. Each pirate would prefer that the treasure be located as close to his own lair as possible. You are allowed to propose a new location for the treasure to the pirates. If at least two out of the three pirates prefer the new location (because it moves closer to their own lairs), then the treasure will be moved there. Assuming the pirates’ lairs form an acute triangle, is it always possible to propose a sequence of new locations so that the treasure eventually ends up in your backyard (wherever that is)? https://cdn.artofproblemsolving.com/attachments/c/c/a9e65624d97dec612ef06f8b30be5540cfc362.png
p7. Homer went on a Donut Diet for the month of May (3131 days). He ate at least one donut every day of the month. However, over any stretch of 77 consecutive days, he did not eat more than 1313 donuts. Prove that there was some stretch of consecutive days over which Homer ate exactly 3030 donuts.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.