Double tower of hanoi: in this variation of the tower of hanoi there are three poles in a row and 2n disks, two 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 pairs 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 2n disks from one pole to another.
(a) find t1 and t2. t1 = t2 =
(b) find t3. t3 =
(c) find a recurrence relation for t1, t2, t3, .

the answer is a

step-by-step explanation:

because if you put 1 in to the square root of x it equals 300.

answer:

your answer is: c. 196 7/8 in^3.

the largest number of the four options is 1.8 x 10-2

you have it in scientific notation.

1.80 x 10-6   = 0.00000180

1.80 x 10-4   = 0.000180 (bigger, or "less small", than the former one)

so

1.8 x 10-2       = 0.0180. as you see. the "less small", or the biggest one of them all.

as you have negative exponent, it means you are dividing 1.8 by 100 (i.e. moving the dot towards left, two times).

if you had positive exponent for the scientific notation, power of tenths, you would be multiplying times 100 (moving the dot towards right) as below:

1.8 x (10)2 = 180

so. if you have negative exponent in scientific notation, move the dot toward left. if it is positive, toward right as many times the exponent tells you.

a

step-by-step explanation: