You and your friend are playing the following (fun!) game. There are two piles of apples. The first player removes some positive integer number of apples from one of the piles. Then, the second player also removes some number of apples from one of the piles. Each player can remove any number of apples from one of the two piles, but cannot take apples from both piles simultaneously. The players alternate until one of them removes the very last apple (from either pile). That player, who removes the very last apple, wins. You deviously encourage your friend to go first. Then, you use a simple copycat strategy: whenever your friend removes j apples from one pile, you always remove the same number japples from the second pile. Prove the following statement using strong induction: Proposition: If at the beginning of the game the two piles contain the same number of apples, then you (the second player) always win using your copycat strategy.

Algebra for College Students
10th Edition
ISBN:9781285195780
Author:Jerome E. Kaufmann, Karen L. Schwitters
Publisher:Jerome E. Kaufmann, Karen L. Schwitters
Chapter2: Equations, Inequalities, And Problem Solving
Section2.4: Formulas
Problem 74PS
icon
Related questions
Question
100%

Please help me solve this problem about induction. 

Problem 1
You and your friend are playing the following (fun!) game. There are two piles of apples. The first player removes some positive integer
number of apples from one of the piles. Then, the second player also removes some number of apples from one of the piles. Each
player can remove any number of apples from one of the two piles, but cannot take apples from both piles simultaneously.
The players alternate until one of them removes the very last apple (from either pile). That player, who removes the very last apple,
wins.
You deviously encourage your friend to go first. Then, you use a simple copycat strategy: whenever your friend removes j apples from
one pile, you always remove the same number j apples from the second pile.
Prove the following statement using strong induction:
Proposition: If at the beginning of the game the two piles contain the same number of apples, then you (the second player) always win
using your copycat strategy.
Transcribed Image Text:Problem 1 You and your friend are playing the following (fun!) game. There are two piles of apples. The first player removes some positive integer number of apples from one of the piles. Then, the second player also removes some number of apples from one of the piles. Each player can remove any number of apples from one of the two piles, but cannot take apples from both piles simultaneously. The players alternate until one of them removes the very last apple (from either pile). That player, who removes the very last apple, wins. You deviously encourage your friend to go first. Then, you use a simple copycat strategy: whenever your friend removes j apples from one pile, you always remove the same number j apples from the second pile. Prove the following statement using strong induction: Proposition: If at the beginning of the game the two piles contain the same number of apples, then you (the second player) always win using your copycat strategy.
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Recommended textbooks for you
Algebra for College Students
Algebra for College Students
Algebra
ISBN:
9781285195780
Author:
Jerome E. Kaufmann, Karen L. Schwitters
Publisher:
Cengage Learning
Intermediate Algebra
Intermediate Algebra
Algebra
ISBN:
9781285195728
Author:
Jerome E. Kaufmann, Karen L. Schwitters
Publisher:
Cengage Learning
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning