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.

i only know the sequence of arithmetic it adds the first is 5+4 then it goes up as it adds to then it is 9+5 then 14+6 then to 20+7 and so on. 5,9,14,20,27,35.

step-by-step explanation:

step-by-step explanation:

this can be solved first with pythagorean theorem, which tells us to square both legs of the triangle and sum it. this will be equal to the square of the hypotenuse.

the hypotenuse is the side "opposite" the 90 degree angle, which is x.

so we can write using pythagorean theorem,

simplifying:

to further simplify this radical, we need to use the property  

thus

i think the answer is b x = 1, y = 35/2