Question 1

Write a one-step equation that relates the number of x
enemies defeated to the maximum high score.

Question 2

Solve the equation to find how many enemies would need to be defeated to achieve the high score.

Your friend suggests that the player should get a fixed amount of bonus points for completing a level. You agree and suggest 200 points for completing the first level.

Question 3

Write a two-step equation that represents how to calculate the player’s high score.

Question 4

Solve the equation to find out how many enemies need to be defeated now to reach the high score.

You suggest that, to make the next level harder, the points awarded for enemies should be higher but the completion bonus lower. You set the enemy points to 60 and the completion bonus to 100 while keeping the maximum score at 1,000. You wonder whether it is possible to defeat the same number of enemies in each level and get the same score.

Question 5

Write an equation that sets the expression for the score of the first level equal to the one for the second level score.

Question 6

How many enemies would you have to defeat in both levels to achieve the same score?

Question 7

What is the score in each level when that number of enemies is defeated?

First person view

Question 1:

1. \(100x = \text{Maximum High Score}\)

Question 2:

2. To find how many enemies need to be defeated to achieve the high score, you would need to know the value of the Maximum High Score.

Question 3:

3. \(100x + 200 = \text{High Score}\)

Question 4:

4. To find out how many enemies need to be defeated now to reach the high score, you would need to know the value of the High Score.

Question 5:

5. \(100x + 200 = 60x + 1000\)

Question 6:

6. To find out how many enemies need to be defeated in both levels to achieve the same score, solve the equation above.

Question 7:

7. Once you have the number of enemies needed to be defeated in both levels to achieve the same score, plug that value back into either equation 3 or 5 to calculate the score in each level.