I assume there are some plus signs that aren't rendering for some reason, so that the plane should be

.
You're minimizing

subject to the constraint

. Note that

and

attain their extrema at the same values of

, so we'll be working with the squared distance to avoid working out some slightly more complicated partial derivatives later.
The Lagrangian is

Take your partial derivatives and set them equal to 0:

Adding the first three equations together yields

and plugging this into the first three equations, you find a critical point at

.
The squared distance is then

, which means the shortest distance must be

.
Answer:
1,632(
Step-by-step explanation:
I did 34,284/252 to figure out the # of groups with 252 people
I got 136.04-- rounded it to 136
I then multiplied 136*12=1,632
so 1,632 people have type A blood
Answer:
y=-1/3x+8
Step-by-step explanation:
There is no need for any specific answers, but here is one that could logically work out. Since the graph is going left/down, it has a negative slope, so -1/3 would be reasonable. The graph doesn't cross the origin and crosses above it, so this equation must have a positive 'b' value. In this case, I chose 8. y=-1/3+8 could represent Laila's graph.
Answer:
1,404,000 unique passwords are possible.
Step-by-step explanation:
The order in which the letters and the digits are is important(AB is a different password than BA), which means that the permutations formula is used to solve this question.
Permutations formula:
The number of possible permutations of x elements from a set of n elements is given by the following formula:

In this question:
2 digits from a set of 10(there are 10 possible digits, 0-9).
3 characters from a set of 26. So

1,404,000 unique passwords are possible.
im 11 can I?
Step-by-step explanation: