I did my math on a piece of paper but the answer would be x= 107/96
From 100 to 80 is 8/10, so the recursive formula is
an=a(n-1)*1/8
or
an= a1*1/8(n-1)
an=a1*(n-1)/8
Answer:
be the second player, and always leave a multiple of 3 balloons
Step-by-step explanation:
In order to win, a player must force the other player to leave one or two balloons. To do that, the winning player must leave one more balloon than the maximum number that can be popped. That is, the winner will be the player who leaves 3 balloons,
Working backward, we find that the winner must leave a multiple of 3 after each turn. Since the starting number is a multiple of 3, the first player must lose if the second player plays optimally.
The winning strategy is ...
- be the second player
- always leave a multiple of 3 balloons.
