Answer and Step-by-step explanation: Congruent triangles are triangles with the same three sides and same three angles.
There many ways to determine if 2 triangles are congruent.
One of them is <u>ASA</u> or <u>Angle, Side, Angle</u> and it means that if two angles and the included side of one triangle are equal to the corresponding angles and side on the other triangle, they are congruent.
In this case, angle MRQ and angle NQR are equal. The included side of both triangles are the same QR, so it can be concluded that <em><u>triangle QNR is congruent to triangle RMQ.</u></em>
The image in the attachment shows the angles and their included side, which are colored.
Answer:
3 + 4 = 7 which is true.
Step-by-step explanation:
Whenever you have an equation with a plain variable (that is, no exponent included), there is only one number that will work when substituted for x.
To solve it, you have to "undo" what is done to the variable. You also go in the reverse order of operations, so you do the addition/subtract first, then multiplication/division.
You also have to do the same to both sides, kind of like keeping a balance scale in balance.
In this case, we subtract 4 from both sides first:
3x + 4 -4 = 7 - 4
The + 4 - 4 cancel each other out, so you get:
3x = 3
3x means "3 times x" so you divide by 3 to undo it. I will use the / to indicate division:
3x / 3 = 3 /3
so 1x = 1.
Since 1x is "1 times x" it is the same as x by itself, so:
x=1
AND, if we substitute 1 back into the original equation (the asterisk stands for multiply):
3 * 1 + 4 = 7
3 * 1 is 3, so:
3 + 4 = 7 which is true.
1 is the only number that works.
Hope this helped.
Answer:
0.17155425219941%
Step-by-step explanation:
100%/x%=682/1.17
(100/x)*x=(682/1.17)*x - we multiply both sides of the equation by x
100=582.90598290598*x - we divide both sides of the equation by (582.90598290598) to get x
100/582.90598290598=x
0.17155425219941=x
x=0.17155425219941
X = 8.5 because 8.5 x 2 = 17 and 17 + 1 = 18
Answer:
2730
Step-by-step explanation:
We want to determine the greatest common divisor of the elements of the set 
We apply the Fermat's little theorem which states that if p is a prime number, then for any integer a, the number aᵖ − a is an integer multiple of p.
Now, 
if p-1 divides 12.
Since the of 12 are 1,2,3,4, 6, 12, the corresponding primes are 2, 3, 5, 7, 13.
Therefore, the gcd of the elements in 
and 
2*3*5*7*13=2730
Therefore, the gcd of the elements in set S is 2730.
