In the previous task you saw that the number of moves to solve the Tower of Hanoi with n disks given by the equation an=2^n-1 What is the fewest number of moves required for 7 disks?

I just wanted to put this here because i did not see it anywhere else. Hope this helps! Good luck! :D <3

can someone answer this question plz

step-by-step explanation:

5: 20

step-by-step explanation:

1) the property is   ixi = a ⇔x = a   o x = -a

4(x-5)+3= 15⇒4x-20+3 = 15⇒4x-17= 15⇒4x = 15+17⇒4x = 32⇒x =32/4= 8

4(x-5) +3= -15⇒4x-20 +3 = -15⇒4x-17= -15⇒4x =-15+17⇒4x = 2⇒x =2/4= 1/2

the values are x =8 and x = 0,5