MathDB

Problems(1)

2013 Math Hour Olympiad - University of Washington - Grades 6-7

Source:

2/28/2022
Round 1
p1. Goldilocks enters the home of the three bears – Papa Bear, Mama Bear, and Baby Bear. Each bear is wearing a different-colored shirt – red, green, or blue. All the bears look the same to Goldilocks, so she cannot otherwise tell them apart. The bears in the red and blue shirts each make one true statement and one false statement. The bear in the red shirt says: “I'm Blue's dad. I'm Green's daughter.” The bear in the blue shirt says: “Red and Green are of opposite gender. Red and Green are my parents.” Help Goldilocks find out which bear is wearing which shirt.
p2. The University of Washington is holding a talent competition. The competition has five contests: math, physics, chemistry, biology, and ballroom dancing. Any student can enter into any number of the contests but only once for each one. For example, a student may participate in math, biology, and ballroom. It turned out that each student participated in an odd number of contests. Also, each contest had an odd number of participants. Was the total number of contestants odd or even?
p3. The 9999 greatest scientists of Mars and Venus are seated evenly around a circular table. If any scientist sees two colleagues from her own planet sitting an equal number of seats to her left and right, she waves to them. For example, if you are from Mars and the scientists sitting two seats to your left and right are also from Mars, you will wave to them. Prove that at least one of the 9999 scientists will be waving, no matter how they are seated around the table.
p4. One hundred boys participated in a tennis tournament in which every player played each other player exactly once and there were no ties. Prove that after the tournament, it is possible for the boys to line up for pizza so that each boy defeated the boy standing right behind him in line.
p5. To celebrate space exploration, the Science Fiction Museum is going to read Star Wars and Star Trek stories for 2424 hours straight. A different story will be read each hour for a total of 1212 Star Wars stories and 1212 Star Trek stories. George and Gene want to listen to exactly 66 Star Wars and 66 Star Trek stories. Show that no matter how the readings are scheduled, the friends can find a block of 1212 consecutive hours to listen to the stories together.
Round 2
p6. 20132013 people attended Cinderella's ball. Some of the guests were friends with each other. At midnight, the guests started turning into mice. After the first minute, everyone who had no friends at the ball turned into a mouse. After the second minute, everyone who had exactly one friend among the remaining people turned into a mouse. After the third minute, everyone who had two human friends left in the room turned into a mouse, and so on. What is the maximal number of people that could have been left at the ball after 20132013 minutes?
p7. Bill and Charlie are playing a game on an infinite strip of graph paper. On Bill’s turn, he marks two empty squares of his choice (not necessarily adjacent) with crosses. Charlie, on his turn, can erase any number of crosses, as long as they are all adjacent to each other. Bill wants to create a line of 20132013 crosses in a row. Can Charlie stop him?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here.
algebracombinatoricsnumber theorygeometryMath Hour Olympiad