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

Astick 2 m long is placed vertically at point b. the top of the stick is in line with the top of a tree as seen from point a, which is 3 m from the stick and 30 m from the tree. how tall is the tree?

You receive 15% of the profit from a car wash how much money do you receive from a profit of 300

Amodel rocket is launched from a roof into a large field. the path of the rocket can be modeled by the equation y = -0.04x^2 + 8.6x + 4.8, where x is the horizontal distance, in meters, from the starting point on the roof and y is the height, in meters, of the rocket above the ground. how far horizontally from its starting point will the rocket land? a. 0.56 m b. 215.56 m c. 431.11 m d. 215.74 m