MathDB
2019 Team #10

Source:

May 1, 2022
2019 Team

Problem Statement

4040 people, numbered 11 through 4040 counterclockwise, sit around a circular table. They begin playing a game. Each person is initially considered "alive". Starting with person 11, the first person eliminates the closest "alive" person to their right (so Person 11 eliminates Person 22). Then the next "alive" person, moving counterclockwise, eliminates the closest "alive" person to their right (so since Person 22 is eliminated, Person 33 eliminates Person 44). This process continues until there is only 11 "alive" person remaining. What is the number of the last "alive" person? [asy] usepackage("cancel", "makeroom, thicklines"); usepackage("bm"); size(15cm); picture p; draw(p, circle((0,0), 5)); for(int i = 0; i < 4; ++i) { label(p, ""+string(40i)+"" + string(40 - i) + "", 5 * dir(-20 * i - 100), 2 * dir(-20 * i - 100)); label(p, ""+string(i+1)+"" + string(i + 1) + "", 5 * dir(20 * i - 80), 2 * dir(20 * i - 80)); } int n = 20; for(int i = 0; i <= n; ++i) { label(p, scale(2)*"\cdot", 6 *dir(180 / n * i)); } draw(p, arc((0,0), 8 * dir(-80), 8 * dir(0)), EndArrow); add(shift(-20, 0) * p); draw((-11, 0)--(-8,0), EndArrow); picture q; draw(q, circle((0,0), 5)); for(int i = 0; i < 4; ++i) { label(q, ""+string(40i)+"" + string(40 - i) + "", 5 * dir(-20 * i - 100), 2 * dir(-20 * i - 100)); if(i != 1) label(q, ""+string(i+1)+"" + string(i + 1) + "", 5 * dir(20 * i - 80), 2 * dir(20 * i - 80)); } int n = 20; for(int i = 0; i <= n; ++i) { label(q, scale(2)*"\cdot", 6 *dir(180 / n * i)); } draw(q, arc((0,0), 8 * dir(-80), 8 * dir(0)), EndArrow); for(int i = 0; i < 1; i+=2) { //label(q, "\bm\xcancel{~}", 5 * dir(-20 * i - 100), 2 * dir(-20 * i - 100)); label(q, "\xcancel{2}", 5 * dir(20 * (i + 1) - 80), 2 * dir(20 * (i + 1) - 80)); } add(q); draw((9,0)--(12,0), EndArrow); picture r; draw(r, circle((0,0), 5)); for(int i = 0; i < 4; ++i) { if(i % 2 == 1) label(r, ""+string(40i)+"" + string(40 - i) + "", 5 * dir(-20 * i - 100), 2 * dir(-20 * i - 100)); if(i % 2 != 1) label(r, ""+string(i+1)+"" + string(i + 1) + "", 5 * dir(20 * i - 80), 2 * dir(20 * i - 80)); } int n = 20; for(int i = 0; i <= n; ++i) { label(r, scale(2)*"\cdot", 6 *dir(180 / n * i)); } draw(r, arc((0,0), 8 * dir(-80), 8 * dir(0)), EndArrow); for(int i = 0; i < 4; i+=2) { label(r, "\xcancel{" + string(40 - i) +"}", 5 * dir(-20 * i - 100), 2 * dir(-20 * i - 100)); label(r, "\xcancel{" + string(i + 1) + "}", 5 * dir(20 * (i + 1) - 80), 2 * dir(20 * (i + 1) - 80)); } add(shift(20, 0) * r); [/asy] In the last step here, Person 3939 eliminates Person 4040. Next turn, Person 11 eliminates the closest person to his right, Person 33.