Results for Monday Math Madness #4
25 Apr 2008 Quan Quach 6 comments 94 views

Monday Mac Madness was the most successful contest we have conducted to date. In total, we received 103 submissions, which is twice as many as our original goal of 50. And since we received more than 50 submissions, we chose two winners for this contest!
Congratulations to Raymond Chong and Allan Wong for winning Monday Math Madness #4!
The Answer is 7!
The answer to the problem is 7. The two most common answers we received were 11 and 6. Some of the explanations were very clear and succinct while some of you struggled to explain your strategy.
Since the personnel at Blinkdagger are too lazy (or dumb) to write up a solution, they have instead chosen to explain the answer by choosing some of the best submissions. One of the clearest explanations came from Greg Zeigler, shown below:
“It would take 7 iterations to determine the three fastest macbooks. I’ll include a visualization as well since this is tough for me to explain properly.
First, make five groups of five and run each group through 1 iteration. Discard the slowest two of each group since there are at least three machines faster than them.
Run an iteration using the fastest macbook from each group. Discard the two slowest, as well as the other two laptops remaining in each of their groups. Then go to the group that had the third fastest and discard the second and third laptops since they are slower than a macbook which is slower than at least two others.
For the same reason, you can discard the third laptop from the group whose laptop was second in the sixth iteration. You know that the first laptop from the sixth iteration (being the fastest of the fastest) is the fastest laptop you have, so you can set it aside. This leaves you with 5 laptops, enough for one more iteration.
The first laptop from the seventh iteration is the second fastest, the second is the third fastest, and as I already said the fastest laptop is the first laptop from the second iteration.”
Another great explanation can be found here by Janet (the Geekmom).
Best responses
-
6 iterations.
Only five machines can be tested simultaneously, so the 25 laptops must be randomly assigned to five groups of five.
Then each group would be tested (iterations 1-5) and the fastest machine from each group would be set aside in a new group.
This new group of five would have to contain the fastest macbook (it would rank first when rated against any four in the previous step).
So the new group would be tested (iteration 6) and the fastest in the group would have to be it.
After the AIME, this s**t is no problem. I’ve got some harder questions if you need them (you do).
-
Did this as a break from revising quantum…
The answer I got was seven tests. To elaborate….
-
i think its 3 because…
you need to do three to get the top three computers out of the twenty (by doing five each time)
that’s it!but it seems too simple, could be completely off…and it probably is
-
The answer is clearly 6. After each test is conducted in iterations of 5, all the laptops are tested. The 6th iteration would simply rank the #1’s from 1 to 5, allowing the the ranks 1 to 3 to be established. But who cares they are macs. (GO UNIX)
-
Hope i get this week’s one right
Thanks for the interesting puzzle.
PS. If you offer a mac as a prize, yoru readership might potentially grow exponentially.
-
In the presumably low-probability event that I win,
I’d like the Amazon voucher. I’d be prepared to accept
a new Macbook Pro as an alternative.
Shout outs
These shout outs go to the people who submitted correct answers, but were not chosen to win the prize. If you included a link to your website/blog, I also hyperlinked it.
Raymond Chong
F Knauss
Il Park
Doug Hull
Kelvin Heng
Jordan Kwan
Chin Hui Han
Erin Rubin
Steve Maguire
Soren Furbo
Mickey Sheu
Janet (Geek Mom)
Steven King
Immanuel Mclaughlin
Lord Thomas Burbridge
Greg Zeigler
Partha Bhattacharya
Anneleen Van Geenhoven
Simon John Youssef Antoun
Yichao
SSDragon
Niall McPherson
Jing Yee Chee
Hostile Fork
Marijn Jongerden
Ingmar Dasseville
Hillel Gershuni
Dieter Shirley
David Sutoyo
Allan Wong
Jack Snoeyink
Gareth McCaughan
Lieven Marchand
Ada Yu
Craig Wiegert
Fred Shipley
Monday Math Madness #5
Don’t forget to check out Monday Math Madness #5 over at wildaboutmath.com this coming Monday!
6 Responses to “Results for Monday Math Madness #4”
Leave a Reply
Include MATLAB code in your comment by doing the following:
<pre lang="MATLAB">
%insert code here
</pre>


I’m happy to see that my solution to the problem was correct. However, I would be even happier if my name was spelled correctly, it’s Marijn not Marigin.
Sorry Marijn,
Corrected!
OK, I’m confused.
This is a solution that shows seven suffices, but the question asked for the minimal number.
How do we know it’s not possible with 6? A correct answer should include both a method of determining the three fastest with 7 tries, AND a proof that there is no possible method with 6 tries.
Thanks.
Hi Josh,
I mentioned in the comments section of the problem statement that a proof of optimality was not required. But you do raise a good point!
Quan
And to think I’d forgotten all about this! Thanks for recognizing my genius!
Josh, here was my entry. I believe it shows (indirectly) why 7 is a minimum bound.
Divide into 5 batches, A through E. Run each batch through, labelling each machine Xn where X = the batch letter, n = the rank in the run.
Run machines A1, B1… E1 through the system, we can simplify the argument by assuming that they rank A to E, fastest to slowest.
A1 is clearly the fastest machine.
The second fastest machine is one of A2 (the fastest machine left in A) or B1 (the fastest machine in groups B-E), but we can’t be sure of which.
If B1 were the second fastest, the third fastest would be one of A2, B2 or C1.
If A2 were the second fastest, the third fastest would be one of A3, B1 or C1.
If we take the union of the possible machines which are second or third fastest, we conveniently see that there are only five unique machines: A2, A3, B1, B2, C1.
Run those machines through the system and the top two are going to be the second and third fastest.