Solving+Equations+Webquest

We are going to explore solving equations by entering each website. Before you click on each stop, write down each question from each section.
 * ==Solving Equations Webquest==


 * Stop One:**

For our first stop we will explore the equation as a balance scale. This applet will allow you to manipulate each equation, then solve the equation while seeing the balance scale move. After you move the balloons and blocks to balance the equation, click continue to solve the equation. Write down the question and then click on Stop One on the right hand side.

1. Write down six equations that you explore and the steps to solve each one. You can explore as many as you like but you must write down and show your work for six!


 * Stop Two:**

Getting a cell phone. Here we will explore three different options for using a cell phone. Write down what you need before clicking on Stop Two on the right.

1. Along with typing your answers in the spaces on the website, also write down on paper: a. The name of the company you choose. b. The answers to the two questions.

2. When you finish with one carrier, click on //Try Another// until you have tried all three.

If you finish everything early, try the Tower of Hanoi and the Peg Puzzle.

=
The Tower of Hanoi puzzle was invented by the French mathematician Edouard Lucas in 1883. We are given a tower of eight disks (initially four in the applet below), initially stacked in increasing size on one of three pegs. The objective is to transfer the entire tower to one of the other pegs (the rightmost one in the applet below), moving only one disk at a time and never a larger one onto a smaller.=====

=
The puzzle is well known to students of Computer Science since it appears in virtually any introductory text on data structures or algorithms. Its solution touches on two important topics discussed later on:===== The applet has several controls that allow one to select the number of disks and observe the solution in a Fast or Slow manner. To solve the puzzle drag disks from one peg to another following the rules. You can drop a disk on to a peg when its center is sufficiently close to the center of the peg. The applet expects you to move disks from the leftmost peg to the rightmost peg. || || **Links:
 * recursive functions and stacks
 * recurrence relations
 * Stop One
 * Stop Two
 * Towers of Hanoi
 * Peg Puzzle ||