Towers of hanoi induction- slight bit i don't understand

  • Thread starter Thread starter pyrosilver
  • Start date Start date
  • Tags Tags
    Bit Induction
Click For Summary

Homework Help Overview

The discussion revolves around the Towers of Hanoi problem, specifically focusing on the induction proof related to the recursive function defining the number of moves required to solve the puzzle. Participants are examining specific lines of reasoning within the proof and clarifying the induction hypothesis.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants are attempting to understand the steps in the induction proof, particularly the transition from one line of reasoning to another. Questions are raised about the validity of certain substitutions and the implications of the induction hypothesis.

Discussion Status

Some participants are providing clarifications on the induction steps, while others are questioning the accuracy of the expressions used in the proof. There is an ongoing exploration of the implications of the induction hypothesis and how it affects the subsequent lines of reasoning.

Contextual Notes

Participants note potential typographical errors in the expressions being used, which may affect the understanding of the proof. There is also a shift in discussion to a different topic involving absolute values, indicating a broader range of mathematical concepts being explored.

pyrosilver
Messages
38
Reaction score
0
Towers of hanoi induction-- slight bit i don't understand

Homework Statement


I am trying to prove towers of hanoi. Now I am on the induction part and there is a part I don't get. I have the whole thing, but i don't understand a couple lines.

Homework Equations


The Attempt at a Solution



WTS: f(n+1) = 2n+1 - 1
By the Induction Hypothesis, f(n) = 2n-1.

Earlier, we showed f(n) = f(n-1) + 1 + f(n-1).

By the recursive definition,
f(n+1) = f(n) + 1 + f(n).
f(n+1) = 2f(n) + 1
f(n+1) = 2(2n-1) + 1
f(n+1) = 2(2n - 2) + 1
f(n+1) = 2n+1 - 1.
QED.

Ok I get the first line...get the second line...I get that you substitute f(n) in the third line... but I have no idea what the fourth and fifth lines are about! Please help me? I need to understand this by tomorrow :(
 
Physics news on Phys.org


pyrosilver said:

Homework Statement


I am trying to prove towers of hanoi. Now I am on the induction part and there is a part I don't get. I have the whole thing, but i don't understand a couple lines.

Homework Equations


The Attempt at a Solution



WTS: f(n+1) = 2n+1 - 1
By the Induction Hypothesis, f(n) = 2n-1.

Earlier, we showed f(n) = f(n-1) + 1 + f(n-1).

By the recursive definition,
f(n+1) = f(n) + 1 + f(n).
f(n+1) = 2f(n) + 1
f(n+1) = 2(2n-1) + 1
f(n+1) = 2(2n - 2) + 1
f(n+1) = 2n+1 - 1.
QED.

Ok I get the first line...get the second line...I get that you substitute f(n) in the third line... but I have no idea what the fourth and fifth lines are about! Please help me? I need to understand this by tomorrow :(
I believe that the induction hypothesis should be (2^n) - 1, it should be clear after fixing that up
 


Oh okay, i missed that, thanks. I'm still confused though...so the third line would be

f(n+1) = 2(2n - 1) + 1, right? why is the next line 2(2n - 2) + 1?
 


after 2(2^n - 1) , you should get (2^n+1 - 2) + 1 --> 2^n+1 - 1 and it is proven.

you have some more typo errors, that line should be 2(2^n - 1) + 1, since you had above that 2f(n) + 1 - which now after clearing up, is definitely 2(2^n - 1) + 1
 


OHHH sorry that took me awhile! Thank you so much lol xD

I have another question on a diff topic? I feel really stupid for asking but I'm not sure what to do.

for proving this carefully:

|x-3| = 8

I know you have to split it into two cases, x-3> 0. x-3 < 0.

For x-3>0,
x-3 = 8
x= 11.

For x-3<0, what do I do? I know it equals -5, but i don't know how to prove it?
 


pyrosilver said:
OHHH sorry that took me awhile! Thank you so much lol xD

I have another question on a diff topic? I feel really stupid for asking but I'm not sure what to do.

for proving this carefully:

|x-3| = 8

I know you have to split it into two cases, x-3> 0. x-3 < 0.

For x-3>0,
x-3 = 8
x= 11.

For x-3<0, what do I do? I know it equals -5, but i don't know how to prove it?

Hi, the absolute function is explicitly defined, so just distinguish the cases where f(x) = x when x > 0 and -x when x < 0; when x> 3 x-3 , when x < 3 -(x-3) or 3-x
 


|x| is equal to x if [itex]x\ge 0[/itex], -x if x< 0.

So |x-3| is equal to x-3 if [itex]x\ge 3[/itex], -(x-3)= -x+ 3 if x< 3.

If [itex]x\ge 3[/itex] then |x- 3| becomes x- 3= 8 or x= 8+ 3= 11, which is, in fact, greater than 3. If x< 3 then |x- 3|= -(x-3)= -x+ 3= 8 so -x= 8- 3= 5 and x= -5, which is, in fact, less than 3. (You should always check to see if the result is in the correct range.)

x= 11 and x= -5 satisfy this equation. If x= 11, then x- 3= 11-3= 8 so |x- 3|= 8. If x= -5, x- 3= -5- 3= -8 so |-8|= 8.
 

Similar threads

  • · Replies 19 ·
Replies
19
Views
4K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
10
Views
2K
  • · Replies 6 ·
Replies
6
Views
9K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K