If your algorithm runs its critical section 1 + 2 + 3 + + (n-2) + (n-1) + n times, what is the asymptotic behavior of the algorithm?

since your problem is x^4 = 81, what you have to undeo is the "to the fourth power" part.

the inverse (opposite operation) of "to the fourth power" is "to the fourth root".

  (x^4) ^ ¼   = 81 ^ ¼  

  81 = 3^4     so (3 ^ 4) ^ ¼   =   3 ^ 1   = 3

by hand: (3 ^ 4) ^ ¼   =   3 ^ (4 x ¼) = 3 ^ 1   = 3   (when you take a power to a power, multiply the exponents.)

or, do it by calculator. one way of finding the fourth root is to use ^ (1/4)

step-by-step explanation:

x ≥ 18 is your answer

step-by-step explanation:

let "a number" = x

(2/3)x + 17 ≥ 29

isolate the variable (x). do the opposite of pemdas (parenthesis, exponent (& root), multiplication, division, addition, subtraction).

first, subtract 17 from both sides.

(2/3)x + 17 (-17) ≥ 29 (-17)

(2/3)x ≥ 29 - 17

(2/3)x ≥ 12

next, multiply 3/2 to both sides to isolate the x

(3/2)(2/3)x ≥ 12(3/2)

x ≥ 12(3/2)

simplify. multiply, then divide

x ≥ (12 * 3)/2

x ≥ (36)/2

x ≥ 18

x ≥ 18 is your answer

~