Answer: i - j - k
Step-by-step explanation:
Taking the cross product between two vectors will give you a third vector that is orthogonal(perpendicular) to both vectors.
<1,1,0> x <1,0,1>
![det(\left[\begin{array}{ccc}i&j&k\\1&1&0\\1&0&1\end{array}\right] )](https://tex.z-dn.net/?f=det%28%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7Di%26j%26k%5C%5C1%261%260%5C%5C1%260%261%5Cend%7Barray%7D%5Cright%5D%20%29)
the determinate of the matrix: <1,-(1),-1>
or: i - j - k
Answer:
no solution
Step-by-step explanation:
Hey!
------------------------------------------------
Answers:
B-B-A-B
A-B-B-B
------------------------------------------------
Explanation:
We assume that the winner is from a private school (B). As we look at the options we can see that there are two options that show B at least 3 times in the span.
------------------------------------------------
Hope This Helped! Good Luck!
Answer:
125/36
Step-by-step explanation:
6-²=36
5-³=125
125/36
Answer:
5 milk shakes
Step-by-step explanation:
From the above question, we know that for the recipe
1/3 cup of milk = 1 milk shake
15/8 cup of milk = y milk shakes
We cross Multiply
15/8 cup × 1 = 1/3cup × y
y = 15/8 cup × 1 /1/3cup
= 15/8 ÷ 1/3
= 15/8 × 3
= 45/8
= 5.625 of 5 5/8 cups of milk
Therefore, the maximum number of
milkshakes the server can make following the recipe porpotians is 5 milk shakes.
