EXPLANATION:
Let the no. of orders Greg served be x.
Orders Chau served = 2x
Orders Maya served= x + 9
Orders served in all= 69
x + 2x + x + 9 = 69
=> 4x + 9 = 69
=> 4x = 69 - 9
=> x = 60/4
=> x = 15
ANSWER:
Number of orders Maya served = (15 + 9) 24
Number of orders Greg served = 15
Number of orders Chau served = (2*15) 30
Hope it helps u!
If there are n coins, then the smallest (minimum) amount of coins we need to flip is 1. The reason why is because the best case scenario would be flipping all heads except the last coin which is tails. This scenario is rare if n is large, but still possible.
Complete the square.
Use de Moivre's theorem to compute the square roots of the right side.
Now, taking square roots on both sides, we have
Use de Moivre's theorem again to take square roots on both sides.
![\implies z = {w_2}^{1/2} = \boxed{\pm \sqrt[4]{3} \, \exp\left(-i\dfrac{5\pi}{12}\right)}](https://tex.z-dn.net/?f=%5Cimplies%20z%20%3D%20%7Bw_2%7D%5E%7B1%2F2%7D%20%3D%20%5Cboxed%7B%5Cpm%20%5Csqrt%5B4%5D%7B3%7D%20%5C%2C%20%5Cexp%5Cleft%28-i%5Cdfrac%7B5%5Cpi%7D%7B12%7D%5Cright%29%7D)
Answer: 88<8n
Step-by-step explanation:
Because 88 is the least amount of time, it goes on one side of the inequity and the 8n goes on the other
Answer:
27
Step-by-step explanation:
V=a^3=3^3=27
