Brainiest and lots of points two twins, mason and jason, play a game in which they have a pile of 99 marbles. they can take anywhere from 1 to 10 marbles each turn. whoever takes the last marble loses. mason starts. both play optimally. who wins, and how many turns will mason and jason take combined? need now

Mason wins after 18 total moves

Step-by-step explanation:

Mason's optimal strategy is to keep the total number of marbles at 11n+1, so he will take 10 marbles to start. For each move Jason makes, Mason will take a number of marbles that makes the sum from the two turns be 11.

After each of Mason's 9 turns, the number of remaining marbles will be ...

89, 78, 67, 56, 45, 34, 23, 12, 1

It doesn't matter how many marbles Jason takes. He will lose on his 9th turn.

the central idea is that:

individuals should refuse to cooperate with institutions they believe unjust.

thoreau felt  that governments were more often agents of corruption than justice, even democracies, and that just because the majority feels a certain way does not make it just or correct in absolute terms. he uses the fact that slavery exists in our democracy to support this idea.

he goes on to say that, as a result, people should live true to their own internal laws regarding right and wrong, as a product of reflection and a moral life, rather than following every law that society imposes. 

step-by-step explanation:

the f

last graph i believe

step-by-step explanation:

worked it out i believe