In a Triple Tower of Hanoi, there are three poles in a row and 3n disks, three of each of n different sizes, where n is any positive integer. Initially, one of the poles contains all the disks placed on top of each other in triples of decreasing size. Disks are transferred one by one from one pole to another, but at no time may a larger disk be placed on top of a smaller disk. However, a disk may be placed on top of one of the same size. Let tn be the minimum number of moves needed to transfer a tower of 3n disks from one pole to another. Find a recurrence relation for t1, t2, t3, . . . . Justify your answer carefully.
What will be an ideal response?
Mathematics
You might also like to view...
Find the area of the shaded region.
A. 
B. 
C. 
D. 
Mathematics
Evaluate the absolute value.|2|
A. 4 B. 0 C. 2 D. -2
Mathematics
Determine whether the polynomial function is cubic or quartic.
A. Quartic B. Cubic
Mathematics
A study prepared for a Sunbelt town's Chamber of Commerce projected that the population of the town in the next 3 yr will grow according to the rule
?
whereP(x) denotes the populationxmo from now.
?
By how much will the population increase during the next 9 mo?
?
__________
?
During the next 16 mo?
?
__________
What will be an ideal response?
Mathematics