ACU Mathematics Problem of the Week
Problem 2 – October 30th, 2017
The Problem of the Week competition, sponsored by Mu Sigma, is now live. This week’s problem can be found below or slips of paper with the problem description can be found on the main bulletin board in the math department. Students have two weeks from issuance of the problem to construct a solution. Simple answers will not suffice for most problems. Your solution must demonstrate a solution method and communicate some understanding of that method to qualify. Students with correct responses will be identified on this blog and the math bulletin board, and the student or students with the most correct responses during the year will be recognized at the departmental dinner each spring. This competition is open to all students regardless of major or affiliation with the department. You may return your solutions to Gaye in the math office any time before noon on the final day.
Issued: Monday, October 30th
Return Solutions By: Monday, November 13th
Cards of the Round Table
This problem was suggested by Grant Fikes, age 11. This is a famous old problem.
Suppose there are cards numbered with the integers 1 through n arranged in order clockwise around a round table. Starting with card number 1, you move clockwise around the table removing every other card still remaining on the table. So if n is larger than 4, the first time around you would remove 2, keep 3, remove 4, keep 5, etc. You keep going around the table, possibly several times, until only 1 card remains. Which card is it that remains?
Solutions will be posted at the Problem of the Week Home Page after submissions are due.
