Answer by Tyler Seacrest for Making a 2n-digit number divisible by 9
I'll add on to SQLnoob's answer and say Bob can't win if n isn'tSo she chooses$$m = \begin{cases}7-k & k < 7 \\1 & k = 7, 8\end{cases}$$For example,
View ArticleAnswer by SQLnoob for Making a 2n-digit number divisible by 9
I believe that Bob can win if n is
View ArticleMaking a 2n-digit number divisible by 9
Alice and Bob play the following game, taking turns. Alice starts and writes a digit from the set M={1, 2, 3, 4, 5, 6} at the blackboard.Bob appends another digit from the set M until a 2n-digit number...
View Article
More Pages to Explore .....
