Difference between revisions of "2020 AMC 10B Problems/Problem 16"

Latest revision as of 22:39, 1 November 2024

The following problem is from both the 2020 AMC 10B #16 and 2020 AMC 12B #14, so both problems redirect to this page.

Problem

Bela and Jenn play the following game on the closed interval $[0, n]$ of the real number line, where $n$ is a fixed integer greater than $4$ . They take turns playing, with Bela going first. At his first turn, Bela chooses any real number in the interval $[0, n]$ . Thereafter, the player whose turn it is chooses a real number that is more than one unit away from all numbers previously chosen by either player. A player unable to choose such a number loses. Using optimal strategy, which player will win the game?

$\textbf{(A)} \text{ Bela will always win.} \qquad \textbf{(B)} \text{ Jenn will always win.} \qquad \textbf{(C)} \text{ Bela will win if and only if }n \text{ is odd.} \\ \textbf{(D)} \text{ Jenn will win if and only if }n \text{ is odd.} \qquad \textbf{(E)} \text { Jenn will win if and only if } n>8.$

Solution 1 (Symmetry)

If Bela selects the middle number in the range $[0, n]$ and then mirror whatever number Jenn selects, then if Jenn can select a number within the range, so can Bela. Jenn will always be the first person to run out of a number to choose, so the answer is $\boxed{\textbf{(A)} \text{ Bela will always win.}}$

Solution 2 (Educated Guess)

First of all, realize that the parity of $n$ likely has no effect on the strategy, since Bela obviously wins when $n=1$ , and it's not hard to find a winning strategy for $n=2$ or $n=3$ (start with $n/2$ ). Similarly, there is no reason the strategy would change when $n>8.$

So we are left with $\textbf{(A)}$ and $\textbf{(B)}.$ From here it is best to try out random numbers and try to find the strategy that will let Bela win, but if you can't find it, realize that it is more likely the answer is $\boxed{\textbf{(A)} \text{ Bela will always win}}$ since Bela has the first move and thus has more control.

Solution 3 (Simulation)

We can just play the game. We can draw a number line to $9$ and assume Bela and Jenn will only play the integer values. From now after playing one round of the game, Bela will win so answers $\textbf{(B)},\textbf{(D)},$ and $\textbf{(E)}$ are eliminated. Now we want to test if Bela will win if $n$ is even so we can draw another number line this time up to $10$ . Now after playing the game, we can find that Bela won yet again so the answer is $\boxed{\textbf{(A)} \text{ Bela will always win}}.$

-minor edits by jjbros

Solution 4 (Answer Choices)

Play out $n=5$ and $n=6$ . In the first case, Bela can choose $0$ and win, and in the second case, Bela can choose $1$ and win (try it out). This rules out $\textbf{(B)}$ , $\textbf{(C)}$ , and $\textbf{(D)}$ .

Next, consider $\textbf{(E)}$ . Assume for the sake of contradiction that this is true; an alternate way of stating this is that for $n>8$ , the second player always wins (we ignore the "only if" statement). Thus, $n=9$ is a win for the second player. Consider $n=11$ . If Bela chooses $11$ , then the game becomes an $n=9$ case where the first player is instead Jenn. However, by the claim that the second player should win $n>8$ , this game should be a win for Bela, but we have already stated that any games with $n>8$ should be a win for Jenn, which is a contradiction. Thus $\textbf{(E)}$ is incorrect, and so the answer is $\boxed{\textbf{(A)} \text{ Bela will always win}}.$

~eevee9406

Video Solution (HOW TO THINK CREATIVELY!!!)

https://youtu.be/0mlJhyy1m4M

~Education, the Study of Everything

Video Solution by TheBeautyOfMath

https://youtu.be/3BvJeZU3T-M

https://youtu.be/0xgTR3UEqbQ

@@ Line 5: / Line 5: @@
 Bela and Jenn play the following game on the closed interval <math>[0, n]</math> of the real number line, where <math>n</math> is a fixed integer greater than <math>4</math>. They take turns playing, with Bela going first. At his first turn, Bela chooses any real number in the interval <math>[0, n]</math>. Thereafter, the player whose turn it is chooses a real number that is more than one unit away from all numbers previously chosen by either player. A player unable to choose such a number loses. Using optimal strategy, which player will win the game?
-<math>\textbf{(A)} \text{ Bela will always win.} \qquad \textbf{(B)} \text{ Jenn will always win.} \qquad \textbf{(C)} \text{ Bela will win if and only if }n \text{ is odd.}</math>
+<math>\textbf{(A)} \text{ Bela will always win.} \qquad \textbf{(B)} \text{ Jenn will always win.} \qquad \textbf{(C)} \text{ Bela will win if and only if }n \text{ is odd.} \\ \textbf{(D)} \text{ Jenn will win if and only if }n \text{ is odd.} \qquad \textbf{(E)} \text { Jenn will win if and only if } n>8.</math>
-<math>\textbf{(D)} \text{ Jenn will win if and only if }n \text{ is odd.} \qquad \textbf{(E)} \text { Jenn will win if and only if } n>8.</math>
 ==Solution 1 (Symmetry)==
@@ Line 12: / Line 11: @@
 ==Solution 2 (Educated Guess)==
-First of all, realize that the parity of <math>n</math> should have no effect on the strategy at all. This is because they can choose real numbers, not integers, so even if <math>n</math> is odd, for example, they can still go halfway. Similarly, there is no reason the strategy would change when <math>n>8.</math>
+First of all, realize that the parity of <math>n</math> likely has no effect on the strategy, since Bela obviously wins when <math>n=1</math>, and it's not hard to find a winning strategy for <math>n=2</math> or <math>n=3</math> (start with <math>n/2</math>).  Similarly, there is no reason the strategy would change when <math>n>8.</math>
-So we are left with <math>\textbf{(A)}</math> and <math>\textbf{(B)}.</math> From here it is best to try out random numbers and try to find the strategy that will let Jenn win, but if you can't find it, realize that it is more likely the answer is <math>\boxed{\textbf{(A)} \text{ Bela will always win}}</math> since Bela has the first move and thus has more control.
+So we are left with <math>\textbf{(A)}</math> and <math>\textbf{(B)}.</math> From here it is best to try out random numbers and try to find the strategy that will let Bela win, but if you can't find it, realize that it is more likely the answer is <math>\boxed{\textbf{(A)} \text{ Bela will always win}}</math> since Bela has the first move and thus has more control.
 ==Solution 3 (Simulation)==
-We can just play the game. We can draw a number line to <math>9</math> and assume Bela and Jenn will only play the integer values. From now after playing one round of the game, Bela will win so answers <math>\textbf{(B)},\textbf{(D)},</math> and <math>\textbf{(E)}</math> are eliminated. Now we want to test if Bela will win iff <math>n</math> is odd so we can draw another number line this time up to <math>10</math>. Now after playing the game, we can find that Bela won yet again so the answer is <math>\boxed{\textbf{(A)} \text{ Bela will always win}}.</math>
+We can just play the game. We can draw a number line to <math>9</math> and assume Bela and Jenn will only play the integer values. From now after playing one round of the game, Bela will win so answers <math>\textbf{(B)},\textbf{(D)},</math> and <math>\textbf{(E)}</math> are eliminated. Now we want to test if Bela will win if <math>n</math> is even so we can draw another number line this time up to <math>10</math>. Now after playing the game, we can find that Bela won yet again so the answer is <math>\boxed{\textbf{(A)} \text{ Bela will always win}}.</math>
-==Video Solutions==
+-minor edits by jjbros
-https://youtu.be/3BvJeZU3T-M (for AMC 10) ~IceMatrix
-https://youtu.be/0xgTR3UEqbQ (for AMC 12) ~IceMatrix
+==Solution 4 (Answer Choices)==
+Play out <math>n=5</math> and <math>n=6</math>. In the first case, Bela can choose <math>0</math> and win, and in the second case, Bela can choose <math>1</math> and win (try it out). This rules out <math>\textbf{(B)}</math>, <math>\textbf{(C)}</math>, and <math>\textbf{(D)}</math>.
+Next, consider <math>\textbf{(E)}</math>. Assume for the sake of contradiction that this is true; an alternate way of stating this is that for <math>n>8</math>, the second player always wins (we ignore the "only if" statement). Thus, <math>n=9</math> is a win for the second player. Consider <math>n=11</math>. If Bela chooses <math>11</math>, then the game becomes an <math>n=9</math> case where the first player is instead Jenn. However, by the claim that the second player should win <math>n>8</math>, this game should be a win for Bela, but we have already stated that any games with <math>n>8</math> should be a win for Jenn, which is a contradiction. Thus <math>\textbf{(E)}</math> is incorrect, and so the answer is <math>\boxed{\textbf{(A)} \text{ Bela will always win}}.</math>
+~eevee9406
+==Video Solution (HOW TO THINK CREATIVELY!!!)==
+https://youtu.be/0mlJhyy1m4M
+~Education, the Study of Everything
+==Video Solution by TheBeautyOfMath==
+https://youtu.be/3BvJeZU3T-M
+https://youtu.be/0xgTR3UEqbQ
 ==See Also==

2020 AMC 10B (Problems • Answer Key • Resources)
Preceded by Problem 15	Followed by Problem 17
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 10 Problems and Solutions

2020 AMC 12B (Problems • Answer Key • Resources)
Preceded by Problem 13	Followed by Problem 15
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 12 Problems and Solutions

Page

Toolbox

Search