<u>T</u>he converse, inverse and contrapositive of each conditional statement include:
- <u>Converse:</u> If two angles have a common side, then they are adjacent.
- <u>Inverse:</u> If two angles are not adjacent, then they do not have a common side.
- <u>Contrapositive:</u> If two angles do not have a common side, then they are not adjacent.
<h3>What is a conditional statement?</h3>
A conditional statement can be defined as a type of statement that can be written to have both a hypothesis and conclusion. Thus, it typically has the form "if P then Q."
<u>Where:</u>
P and Q represent sentences.
In this scenario, we would write the converse, inverse and contrapositive of each conditional statement as follows:
- <u>Converse:</u> If two angles have a common side, then they are adjacent.
- <u>Inverse:</u> If two angles are not adjacent, then they do not have a common side.
- <u>Contrapositive:</u> If two angles do not have a common side, then they are not adjacent.
Read more on conditional statement here: brainly.com/question/16951916
#SPJ1
Answer:
<h2>The answer is 5 units</h2>
Step-by-step explanation:
The distance between two points can be found by using the formula

where
(x1 , y1) and (x2 , y2) are the points
From the question
The points are (9,-7) and (5, -4)
The distance between them is

We have the final answer as
<h3>5 units</h3>
Hope this helps you
Answer:
The answer is no. It's not true.
Step-by-step explanation:
1/10 is the same as 10%. 10% of 100 is 10. In conclusion, the statement isn't true.
Answer:
There are 336 ways can the teams finish first, second, and third
Step-by-step explanation:
Total no. of teams = 8
First prize is given to one of the 8 teams
So, no. of teams left for second prize = 8-1 =7
Second prize is given to one of the remaining 7 teams
So, no. of teams left for third prize = 7-1=6
So,the teams finish first, second, and third in no. of ways =
The teams finish first, second, and third in no. of ways = 336
Hence there are 336 ways can the teams finish first, second, and third
I bet the ODE is supposed to read

Then if
, we have
and
, and substituting these into the ODE gives

Solving for <em>r</em>, we find

so that
and
are two fundamental solutions to the ODE. Thus the general solution is

Given that
and
, we get

So the particular solution is
