HELP ASAP! BRAINLIEST TO WHOEVER HELPS!! Use a proof by mathematical induction to show that your equation from question 1 (2^n - 1) applies to
the minimum number of moves required to defeat the Tower of Hanoi game, based on the
number of disks you must move. Think about the process of the game; and describe how your
equation applies to it.

Pls! does anybody know a shortcut for answering these types of questions in the future?

Idont understand math at all! : o( use this scenario to answer the remaining questions: brenton purchased a new bedroom set for $4,500.00. he lives in arizona and pays a 8.75% sales tax. if he made a 50% down payment and financed the rest, what amount did he finance? what is the total sales tax brenton will pay? enter your answer in currency format, round to the nearest cent. what was brenton's total amount financed? enter your answer in currency format, round to the nearest cent.

Express the following as a function of a single angle. cos(60) cos(-20) - sin(60) sin(-20)