Two players multiply a number until it reaches 1000
$begingroup$
Two players start with $1$ and take turns multiplying it by $2$ or $3$ or $4$ ... or $9$. The first player to make the number $ge 1000$ wins. Who has a winning strategy?
My attempt: obviously $112$ is a losing position since $112*9=1008$. Then
it's a winning position for all numbers between $56$ to $111$. Then the first player can choose to multiply by $5$ on the first turn, then on his second turn he can always multiply a number so it's between $56$ and $111$. Therefore the first player has a winning strategy.
Is this solution correct. Is there another way of doing it? Also, in general, who has a winning strategy if the first player to make the number $ge n$ wins?
combinatorics proof-verification game-theory
$endgroup$
add a comment |
$begingroup$
Two players start with $1$ and take turns multiplying it by $2$ or $3$ or $4$ ... or $9$. The first player to make the number $ge 1000$ wins. Who has a winning strategy?
My attempt: obviously $112$ is a losing position since $112*9=1008$. Then
it's a winning position for all numbers between $56$ to $111$. Then the first player can choose to multiply by $5$ on the first turn, then on his second turn he can always multiply a number so it's between $56$ and $111$. Therefore the first player has a winning strategy.
Is this solution correct. Is there another way of doing it? Also, in general, who has a winning strategy if the first player to make the number $ge n$ wins?
combinatorics proof-verification game-theory
$endgroup$
$begingroup$
Do you think "generalization" is a good tag?
$endgroup$
– YuiTo Cheng
Jan 30 at 7:33
$begingroup$
I think the usual terminology is to call $112$ a winning position (i.e. it is winning for the player to move).
$endgroup$
– TonyK
Jan 30 at 10:52
add a comment |
$begingroup$
Two players start with $1$ and take turns multiplying it by $2$ or $3$ or $4$ ... or $9$. The first player to make the number $ge 1000$ wins. Who has a winning strategy?
My attempt: obviously $112$ is a losing position since $112*9=1008$. Then
it's a winning position for all numbers between $56$ to $111$. Then the first player can choose to multiply by $5$ on the first turn, then on his second turn he can always multiply a number so it's between $56$ and $111$. Therefore the first player has a winning strategy.
Is this solution correct. Is there another way of doing it? Also, in general, who has a winning strategy if the first player to make the number $ge n$ wins?
combinatorics proof-verification game-theory
$endgroup$
Two players start with $1$ and take turns multiplying it by $2$ or $3$ or $4$ ... or $9$. The first player to make the number $ge 1000$ wins. Who has a winning strategy?
My attempt: obviously $112$ is a losing position since $112*9=1008$. Then
it's a winning position for all numbers between $56$ to $111$. Then the first player can choose to multiply by $5$ on the first turn, then on his second turn he can always multiply a number so it's between $56$ and $111$. Therefore the first player has a winning strategy.
Is this solution correct. Is there another way of doing it? Also, in general, who has a winning strategy if the first player to make the number $ge n$ wins?
combinatorics proof-verification game-theory
combinatorics proof-verification game-theory
edited Jan 30 at 10:48
Asaf Karagila♦
307k33441774
307k33441774
asked Jan 30 at 5:10


abc...abc...
3,237739
3,237739
$begingroup$
Do you think "generalization" is a good tag?
$endgroup$
– YuiTo Cheng
Jan 30 at 7:33
$begingroup$
I think the usual terminology is to call $112$ a winning position (i.e. it is winning for the player to move).
$endgroup$
– TonyK
Jan 30 at 10:52
add a comment |
$begingroup$
Do you think "generalization" is a good tag?
$endgroup$
– YuiTo Cheng
Jan 30 at 7:33
$begingroup$
I think the usual terminology is to call $112$ a winning position (i.e. it is winning for the player to move).
$endgroup$
– TonyK
Jan 30 at 10:52
$begingroup$
Do you think "generalization" is a good tag?
$endgroup$
– YuiTo Cheng
Jan 30 at 7:33
$begingroup$
Do you think "generalization" is a good tag?
$endgroup$
– YuiTo Cheng
Jan 30 at 7:33
$begingroup$
I think the usual terminology is to call $112$ a winning position (i.e. it is winning for the player to move).
$endgroup$
– TonyK
Jan 30 at 10:52
$begingroup$
I think the usual terminology is to call $112$ a winning position (i.e. it is winning for the player to move).
$endgroup$
– TonyK
Jan 30 at 10:52
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Yes, this is a good strategy and demonstration that it works. $4$ and $6$ also work.
You might compare with the game where you add instead of multiply and are allowed to add $1,2,3,4$ at each turn and the first to reach some total, say $27$ wins. A player can always guarantee that two successive turns add to $5$, so the first player wins by taking $2$, then hitting $7,12,17,22,27$.
In your game a player can guarantee that two turns multiply by at least $18$ but one turn cannot multiply by more than $9$. Your $56$ comes from $lceil frac {1000}{18}rceil$ and $111$ from $lfloor frac {1000}9 rfloor$. This suggests that for target $T$ and $n$ pairs of turns before the end you should leave between $lceil frac T{18^n} rceil$ and $lfloor frac T{18^{n-1}cdot 9}rfloor$ The worry is that you can't guarantee that two turns will multiply by exactly $18$. If your opponent multiplies by $7$ you have to choose between $2$ and $3$, making the pair multiply by $14$ or $21$. I believe you are OK because the range is a factor $2$. In this example if multiplying by $3$ is too much, $2$ will be enough to stay in range.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3093123%2ftwo-players-multiply-a-number-until-it-reaches-1000%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Yes, this is a good strategy and demonstration that it works. $4$ and $6$ also work.
You might compare with the game where you add instead of multiply and are allowed to add $1,2,3,4$ at each turn and the first to reach some total, say $27$ wins. A player can always guarantee that two successive turns add to $5$, so the first player wins by taking $2$, then hitting $7,12,17,22,27$.
In your game a player can guarantee that two turns multiply by at least $18$ but one turn cannot multiply by more than $9$. Your $56$ comes from $lceil frac {1000}{18}rceil$ and $111$ from $lfloor frac {1000}9 rfloor$. This suggests that for target $T$ and $n$ pairs of turns before the end you should leave between $lceil frac T{18^n} rceil$ and $lfloor frac T{18^{n-1}cdot 9}rfloor$ The worry is that you can't guarantee that two turns will multiply by exactly $18$. If your opponent multiplies by $7$ you have to choose between $2$ and $3$, making the pair multiply by $14$ or $21$. I believe you are OK because the range is a factor $2$. In this example if multiplying by $3$ is too much, $2$ will be enough to stay in range.
$endgroup$
add a comment |
$begingroup$
Yes, this is a good strategy and demonstration that it works. $4$ and $6$ also work.
You might compare with the game where you add instead of multiply and are allowed to add $1,2,3,4$ at each turn and the first to reach some total, say $27$ wins. A player can always guarantee that two successive turns add to $5$, so the first player wins by taking $2$, then hitting $7,12,17,22,27$.
In your game a player can guarantee that two turns multiply by at least $18$ but one turn cannot multiply by more than $9$. Your $56$ comes from $lceil frac {1000}{18}rceil$ and $111$ from $lfloor frac {1000}9 rfloor$. This suggests that for target $T$ and $n$ pairs of turns before the end you should leave between $lceil frac T{18^n} rceil$ and $lfloor frac T{18^{n-1}cdot 9}rfloor$ The worry is that you can't guarantee that two turns will multiply by exactly $18$. If your opponent multiplies by $7$ you have to choose between $2$ and $3$, making the pair multiply by $14$ or $21$. I believe you are OK because the range is a factor $2$. In this example if multiplying by $3$ is too much, $2$ will be enough to stay in range.
$endgroup$
add a comment |
$begingroup$
Yes, this is a good strategy and demonstration that it works. $4$ and $6$ also work.
You might compare with the game where you add instead of multiply and are allowed to add $1,2,3,4$ at each turn and the first to reach some total, say $27$ wins. A player can always guarantee that two successive turns add to $5$, so the first player wins by taking $2$, then hitting $7,12,17,22,27$.
In your game a player can guarantee that two turns multiply by at least $18$ but one turn cannot multiply by more than $9$. Your $56$ comes from $lceil frac {1000}{18}rceil$ and $111$ from $lfloor frac {1000}9 rfloor$. This suggests that for target $T$ and $n$ pairs of turns before the end you should leave between $lceil frac T{18^n} rceil$ and $lfloor frac T{18^{n-1}cdot 9}rfloor$ The worry is that you can't guarantee that two turns will multiply by exactly $18$. If your opponent multiplies by $7$ you have to choose between $2$ and $3$, making the pair multiply by $14$ or $21$. I believe you are OK because the range is a factor $2$. In this example if multiplying by $3$ is too much, $2$ will be enough to stay in range.
$endgroup$
Yes, this is a good strategy and demonstration that it works. $4$ and $6$ also work.
You might compare with the game where you add instead of multiply and are allowed to add $1,2,3,4$ at each turn and the first to reach some total, say $27$ wins. A player can always guarantee that two successive turns add to $5$, so the first player wins by taking $2$, then hitting $7,12,17,22,27$.
In your game a player can guarantee that two turns multiply by at least $18$ but one turn cannot multiply by more than $9$. Your $56$ comes from $lceil frac {1000}{18}rceil$ and $111$ from $lfloor frac {1000}9 rfloor$. This suggests that for target $T$ and $n$ pairs of turns before the end you should leave between $lceil frac T{18^n} rceil$ and $lfloor frac T{18^{n-1}cdot 9}rfloor$ The worry is that you can't guarantee that two turns will multiply by exactly $18$. If your opponent multiplies by $7$ you have to choose between $2$ and $3$, making the pair multiply by $14$ or $21$. I believe you are OK because the range is a factor $2$. In this example if multiplying by $3$ is too much, $2$ will be enough to stay in range.
answered Jan 30 at 5:32


Ross MillikanRoss Millikan
301k24200375
301k24200375
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3093123%2ftwo-players-multiply-a-number-until-it-reaches-1000%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Do you think "generalization" is a good tag?
$endgroup$
– YuiTo Cheng
Jan 30 at 7:33
$begingroup$
I think the usual terminology is to call $112$ a winning position (i.e. it is winning for the player to move).
$endgroup$
– TonyK
Jan 30 at 10:52