9514 1404 393
Answer:
2
Step-by-step explanation:
The solutions are ...
p +m|x +n| = k . . . . . given
m|x +n| = k -p . . . . . . subtract p
|x +n| = (k -p)/m = (p -k)/-m . . . . . . must have (p-k)/-m ≥ 0
x = -n ± (p -k)/-m
For the given conditions, m < 0, p > k, we are guaranteed that (p-k)/-m > 0, so there are 2 solutions.
To calculate the distance between these two points, we use the Pythagorean theorem since the two points can form a right triangle when plotted where the hypotenuse would be the distance between these two. We do as follows:
d = √[(x2-x1)^2 + (y2-y1)^2]
d = √[(3-1)^2 + (9-4)^2]
d = √29 = 5.39 units
The correct answer is A.
THE MULTIPLE OF 3 ARE: 3 , 6 , 9 ,12
The 1st magazine costs either 3 or 6 or 9 , 12
The 2nd magazine costs <span>3 or 6 or 9 , 12
The value 12 is to be discarded , then are the sum of tall possibilities to get 12:
</span>mag 1st mag 2nd total
------------ ------------ --------
3 9 12
6 6 12
9 3 12
This is a linear programming question
if u want to solve the question, u can plot a graph(see the picture)
while x is n, y is r
and u may find out all of the integral values of x ,y in the required region, and sub them to 6450x+7150y=c, where c is the overall customers number, see which point give u the largest number of customers, u may get the ans then
Answer:
9.42 (sorry if im late)
Step-by-step explanation:
I believe that if you take the radius and multiply it by pi (3.14), you get the circumfrence
3.14 x 3 = 9.42