Solution: The Tower of Hanoi. This is a game with three pegs and n disks (largest on the | StudySoup

Textbook Solutions for Algebra and Trigonometry

Chapter 12 Problem 30

Question

The Tower of Hanoi. This is a game with three pegs and n disks (largest on the bottom and smallest on the top). The goal is to move this entire tower of disks to another peg (in the same order). The challenge is that you may move only one disk at a time, and at no time can a larger disk be resting on a smaller disk. You may want to rst go online to www.mazeworks.com/hanoi/index/htm and play the game.Geometry. Prove, with mathematical induction, that the sum of the interior angles of a regular polygon of n sides is given by the formula: for Hint: Divide a polygon into triangles. For example, a four-sided polygon can be divided into two triangles. A ve-sided polygon can be divided into three triangles. A six-sided polygon can be divided into four triangles, and so on.

Solution

Step 1 of 7)

The first step in solving 12 problem number 314 trying to solve the problem we have to refer to the textbook question: The Tower of Hanoi. This is a game with three pegs and n disks (largest on the bottom and smallest on the top). The goal is to move this entire tower of disks to another peg (in the same order). The challenge is that you may move only one disk at a time, and at no time can a larger disk be resting on a smaller disk. You may want to rst go online to www.mazeworks.com/hanoi/index/htm and play the game.Geometry. Prove, with mathematical induction, that the sum of the interior angles of a regular polygon of n sides is given by the formula: for Hint: Divide a polygon into triangles. For example, a four-sided polygon can be divided into two triangles. A ve-sided polygon can be divided into three triangles. A six-sided polygon can be divided into four triangles, and so on.
From the textbook chapter Sequences, Series, and Probability you will find a few key concepts needed to solve this.

Step 2 of 7)

Visible to paid subscribers only

Step 3 of 7)

Visible to paid subscribers only

Subscribe to view the
full solution

Title Algebra and Trigonometry 3 
Author Cynthia Y. Young
ISBN 9780470648032

Solution: The Tower of Hanoi. This is a game with three pegs and n disks (largest on the

Chapter 12 textbook questions

×

Login

Organize all study tools for free

Or continue with
×

Register

Sign up for access to all content on our site!

Or continue with

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back