Step-by-step explanation:
You need to translate all the points to the right 3 and up 6
Therefore, you are going to use this formula:
(x,y) ⇾ (x + 3, y + 6)
This is the same format as the previous problem, if you have noticed.
Using this, plug in each coordinate, starting with P (5, -1)
(5, -1) ⇾ ( 5 + 3, -1 + 6)
(5, -1) ⇾ ( 8, 5 )
P
= (8, 5)
Now point Q, (0, 8)
(0, 8) ⇾ (0 + 3, 8 + 6)
(0, 8) ⇾ ( 3, 14 )
Q = (3, 14)
And last but not least, the point R, (7, 5)
(7, 5) ⇾ (7 + 3, 5 + 6)
(7, 5) ⇾ ( 10, 11 )
R = (10, 11)
Therefore, P = (8, 5), Q = (3, 14), R = (10, 11) is your answer. This is the 4th option or D.
Hope this for you to understand this a bit more! =D
Answer:
y = 
Step-by-step explanation:
Given
Ry - wy = t ← factor out y from each term on the left side
y(R - w) = t ( divide both sides by (R - w ) )
y =
Answer:
8 inches
Step-by-step explanation:
Let w represent the width.
If the length is 14 inches longer than the width, it can be represented by w + 14.
Use the perimeter formula, p = 2l + 2w. Plug in 60 as the perimeter and w + 14 as l, then solve for w:
p = 2l + 2w
60 = 2(w + 14) + 2w
60 = 2w + 28 + 2w
60 = 4w + 28
32 = 4w
8 = w
So, the width is 8 inches
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.
The solution is at what point the two lines intersect.
Plug y into the other equation to get: 5x-4(5-3x)=-3
Multiply it out: 5x+12x-20=-3
Combine like terms and add 20 to both sides: 17x=17
Divide both sides by 17: x=1
Now plug the x value back into any equation to get the y value.
So you get y=5-3(1) --> y=2
The solution is (1, 2)
