Suppose you are given a set of small boxes, numbered 1 to n, identical in every respect except that each of the first i contain a pearl whereas the remaining n − i are empty. you also have two magic wands that can each test whether a box is empty or not in a single touch, except that a wand disappears if you test it on an empty box. show that, without knowing the value of i, you can use the two wands to determine all the boxes containing pearls using at most o(n) wand touches. express, as a function of n, the asymptotic number of wand touches needed

b. 6

step-by-step explanation:

we are given the table representing an exponential function.

we can see from the table that, as x is increasing, the value of y is increasing in the power of 6.

i.e. the following relation is obtained,

x = 1, y = 6

x = 2, y = 36 =

x = 3, y = 216 =

x = 4, y = 1296 =

x = 5, y = 7776 =

so, the geometric series obtained is .

thus, the common ratio is given by = = 6.

hence, the common ratio is 6.

no solution

step-by-step explanation:

there is not enough information in the problem to solve.

30.5*10=350$

you have to multiply the number without the decimal point then add it later but if its tenn u must move the place value of the decimal point 1 to the right.