The plan that cannot be used to prove that the two triangles are congruent based in the given information is: b. ASA.
<h3>How to Prove Two Triangles are Congruent?</h3>
The following theorems can be used to prove that two triangles are congruent to each other:
- SSS: This theorem proves that two triangles are congruent when there's enough information showing that they have three pairs of sides that are congruent to each other.
- ASA: This theorem shows that of two corresponding angles of two triangles and a pair of included congruent sides are congruent to each other.
- SAS: This theorem shows that if two triangles have two pairs of sides and a pair of included angle that are congruent, then both triangles are congruent to each other.
The two triangles only have a pair of corresponding congruent angles, while all three corresponding sides are shown to be congruent to each other.
This means that ASA which requires two pairs of congruent angles, cannot be used to prove that both triangles are congruent.
The answer is: b. ASA.
Learn more about congruent triangles on:
brainly.com/question/1675117
#SPJ1
Answer:
Its A
Step-by-step explanation:
To find the answer, multiply 8 by 4 to get 32. Now divide 32 by 4 and you should get the answer 8. This will make sure that your answer is correct. And so 32 divided by 4 equals 8.
8*4
Multiply
Final Answer: 32
32/4
Divide
Final Answer: 8
Answer:
The partial fraction decomposition is
.
Step-by-step explanation:
Partial-fraction decomposition is the process of starting with the simplified answer and taking it back apart, of "decomposing" the final expression into its initial polynomial fractions.
To find the partial fraction decomposition of
:
First, the form of the partial fraction decomposition is

Write the right-hand side as a single fraction:

The denominators are equal, so we require the equality of the numerators:

Expand the right-hand side:

The coefficients near the like terms should be equal, so the following system is obtained:

Solving this system, we get that
.
Therefore,
