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.

x =±sqrt(1/3)

step-by-step explanation:

x+4/6x=1/x

multiply each side by 6x to get rid of the fractions

6x*(x+4/6x)=1/x*6x

distribute

6x^2 +4 = 6

subtract 4 from each side

6x^2 +4-4 = 6-4

6x^2 =2

divide by 6

6x^2/6 = 2/6

x^2 = 1/3

take the square root of each side

sqrt(x^2) = ±sqrt(1/3)

x =±sqrt(1/3)

1. sometimes

2. never true

3. sometimes

step-by-step explanation:

these are pretty self explanatory if you know what supp right and com angles are

we have three similar triangles, because each has a right angle and shares an angle.   let's write the angles in order: opposite to short leg, long leg, hypotenuse.

cab similar to bad similar to cbd

or as ratios,

ca: ab: cb = ba: ad: bd = cb: bd: cd

we also know

ac = ad + cd

(ad+cd): ab: cb = ba: ad: bd = cb: bd: cd

(ad+cd)/cb=cb/cd

we have cb=6, ad=5 and seek x=cd.

we reject the negative root and conclude x=4

answer: 4

but which class are u may know that first