Answer:
The correct option is;
A 1
Step-by-step explanation:
The given rectangle TUVW has coordinates T(a, b), U (a + 2, b + 2), V ( a + 5, b - 1) and W (a + 3, b - 3).
Given that the coordinates of T and U are T (a, b), and U (a + 2, b + 2), we have;
The slope, m of the line TU is is found by the following relation;
Where we put (x₁, y₁) = (a, b) and (x₂, y₂) = (a + 2, b + 2), we have;
m = ((b + 2) - b)/((a + 2) - a) = 2/2 = 1
Whereby the slope of a line parallel to another line are equal, we have that the slope of the line parallel to the line that contains the side TU is also 1.
Answer:
<u><em>(x, y) -------> ( - x , y - 10 )</em></u>
Step-by-step explanation:
Titus is not correct.
There are two transformations will correctly prove FEDCBA ≅ F'E'D'C'B'A'
First transformation is Reflection over y-axis , then translation 10 units down.
The final formula is <em>( - x , y - 10 )</em>
Answer:
Step-by-step explanation:
Given the expression 4^{-2}•7^{-2}. The following expression are equivalent to given expression on simplification.
Generally from indices, a^-b = 1/a^b. Applying this to the given expression we have:
4^{-2}•7^{-2} = 1/4^2 • 1/7^2
= 1/(4×4) • 1/(7×7)
= 1/16 • 1/49
= 1/(16×49)
= 1/784
Answer: 999 games
Step-by-step explanation:
There are many ways to illustrate the rooted tree model to calculate the number of games that must be played until only one player is left who has not lost.
We could go about this manually. Though this would be somewhat tedious, I have done it and attached it to this answer. Note that when the number of players is odd, an extra game has to be played to ensure that all entrants at that round of the tournament have played at least one game at that round. Note that there is no limit on the number of games a player can play; the only condition is that a player is eliminated once the player loses.
The sum of the figures in the third column is 999.
We could also use the formula for rooted trees to calculate the number of games that would be played.
where i is the number of "internal nodes," which represents the number of games played for an "<em>m</em>-ary" tree, which is the number of players involved in each game and l is known as "the number of leaves," in this case, the number of players.
The number of players is 1000 and each game involves 2 players. Therefore, the number of games played, i, is given by
Answer:
1) a, the first printer
2) b, the second printer
Step-by-step explanation:
