#Help please
1 messages · Page 1 of 1 (latest)
- Do not ping the Moderators, unless someone is breaking the rules.
- Do not ping the Helper Moderators, unless there is a conflict between helpers.
- Do not ping other members randomly for help.
- Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
- Wait patiently for a helper to come along.
- If the Helper has answered your question, remember to thank them with the Mathematics Ranks bot and close the thread with:
+close
Feel free to nominate the person for helper of the week in #helper-nominations
If you're happy with the help you got here, and the server overall, you can contribute financially as well:
do yk the game where you have like some stones and each player takes up to 3 stones
and whoever takes the last one wins
this is like, the same concept
@idle seal this is gpt response, but this is a bit vague and i don't know if it's correct
dont use gpt ever
i don't know what to do ðŸ˜
so think about this
whats the smallest number where alice is guaranteed to win
so basically
wait no
the secfond person
where the second person is guaranteed to win
whats the smallest number where
no matter what alice does
charlie wins
if the starting number is 110 then charlie is guaranteed to win ig
that's the smallest i can think of
ye i think it is 111
the second smallest number
what if alice plays k=1
and now who has the winning advantage when 110 is the number and someoen goes first
@paper frost ?
Charlie
@idle seal but what abt part a?
Isn’t that a bit vague?
it is chariles move at 110, no?
No?
Bcuz he has only one option to subtract
Which is 1
He can’t subtract 0 Bcuz it’s not a non-zero digit
So if he subtracts 1, then 110-1=109 and now it’s Alice’s turn and she can subtract 9 from 109 and win
Yes
Yes because Alice always starts first
It says in the q
well we need the 2nd smallest number such that charlie is guaranteed to win
a hint is
how can charlie force alice to move at 110?
He can’t?
Alice wins every time, no?
yup
so that’s not a forced win for him
try finding smthn else
a number for charlie
@paper frost sorry i just woke up
I did part a
I’m now doing part b
But I don’t know how to find a general formula
how’d you do it
I’m out rn I’ll be back in 30 mins and I’ll show u
alr
why can’t charlie subtract any number greater than 2
anyways you should notice a pattern
the force 120 is good
wdym?
why is charlie forced to subtract 1 at 110
and why can charlie subtract only 1 or 2 at 120
because there's only one non-zero digit he can subtract from 110, which is one
ok by 'digits' i mean the digits of the three digit number
that's how i understood the question
oh
'a move consists of choosing a non-zero digit, k, of n and replacing n with n-k on the blackboard'
yes
for part two we want a general proof
think about if k is any digit from 1-9
yea there’s a systematic way
ok
try it out
so if the starting digit is 101, then Alice loses because in the first move Alice can only subtract one
wait no
nvm
it's not working
hmm i guess what we can do is play the game ourselves
pick a number and pick who you wanna be
Alice
we can do 150
it’s fine
so if i subtract 5 then im gonna write 145
136
i subtract 6 130
127
i subtract 7 120
118
sub 8
110
109
sub 9
ohh so charlie wins
129
120
118
100
alright try to write the proof now
if the player ends up in a three digit where the tens place is {0,1,2...,9} and the units place is 0 then this player wins
try a systematic explanation for alice’s winning strategy
her moves follow a simple pattern
ok i'll let you know when im done
meanwhile can you help me with this - https://discord.com/channels/624314920158232616/1351647642312114246
pls
alr
@paper frost
Hello stem369, this is a friendly reminder that your help request has been inactive for more than 24 hours. If you no longer need assistance, please consider closing the thread using the +close command. This thread will be automatically closed in 3 days if it remains inactive.
