SOLUTION: Candace and Darryl are playing a game with piles of beans. On each player’s turn, they must remove at least one, but at most 7 beans from one of the piles. It is Candace’s turn and

Algebra ->  Customizable Word Problem Solvers  -> Misc -> SOLUTION: Candace and Darryl are playing a game with piles of beans. On each player’s turn, they must remove at least one, but at most 7 beans from one of the piles. It is Candace’s turn and      Log On

Ad: Over 600 Algebra Word Problems at edhelper.com


    

Question 1074181: Candace and Darryl are playing a game with piles of beans. On each player’s turn, they must remove at least one, but at most 7 beans from one of the piles. It is Candace’s turn and there are two piles of beans with 25 and 27 beans in each. The winner is the player to take the last bean. Who should win if we reverse the game, that is, if the loser is the player to take the last bean?
Answer by ikleyn(52810) About Me  (Show Source):
You can put this solution on YOUR website!
.
Solved and answered in
https://www.algebra.com/algebra/homework/Problems-with-consecutive-odd-even-integers/Problems-with-consecutive-odd-even-integers.faq.question.1074179.html

https://www.algebra.com/algebra/homework/Problems-with-consecutive-odd-even-integers/Problems-with-consecutive-odd-even-integers.faq.question.1074179.html