Answer:

Step-by-step explanation:
The equation of a circle with center (a,b) and radius r, is

From the question, the center of the circle is located at (-6,2) and the radius is

We substitute the center and radius to get:

Simplify to obtain:

We need to solve x+2y=11 for x
Let's start by adding -2y to both sides
x+2y -2y = 11-2y
x= -2y+11
Now substitute -2y+11 for x in x-2y =-1
x-2y=-1
-2y+11-2y=-1
-4y+11=-1
Add -11 to both sides
-4y+11-11=-1-11
-4y=-12
Divide both sides by -4
-4y/-4 = -12/-4
y= 3
Substitute 3 for y in x=-2y+11
x= -2y+11
x = (-2)(3)+11
x=-6+11
x=5
The answer is x=5 and y=3
(5,3)
I hope that's help:)
Answer:49/8
Step-by-step explanation:7/8 times 7 is 49/8
Answer:
<em>Part A </em>C = (10,5)<em> Part B </em>C. D'(0,10)
Step-by-step explanation:
<em>Part A</em>
Since c is at the point (2,1) in relation to the origin, we can multiply those distances by our scale factor of 5
(2,1) * 5 = (10,5)
The new point C is going to be (10,5)
<em>Part B</em>
If you dilate with a factor of 5 -- relative to the origin -- you have to multiply the distance from <em>the origin</em> by 5.
In this case, point D is already on the y axis, so it's x value wouldn't be affected. Point D is currently 2 units away from (0,0), so we can multiply 2*5 to get 10 -- our ending point is (0,10)
Answer:
32760 ways
Step-by-step explanation:
Given
Number of Candidates = 15
Job Positions = 4
Required:
Number of outcomes
This question represent selection; i.e. selecting candidates for job positions;
This question can be solved in any of the following two ways
Method 1.
The first candidate can be chosen from any of the 15 candidates
The second candidate can be chosen from any of the remaining 14 candidates
The third candidate can be chosen from any of the remaining 13 candidates
The fourth candidate can be chosen from any of the remaining 12 candidates
Total Possible Selection = 15 * 14 * 13 * 12
<em>Total Possible Selection = 32760 ways</em>
<em></em>
Method 2:
This can be solved using permutation method which goes thus;

Where n = 15 and r = 4
So;
becomes





<em>Hence, there are 32760 ways</em>