Answer:
A
Step-by-step explanation:
if X is 7, and is connected/touching the three. You have to multiply and 7×3=21
Answer:
1/9
Step-by-step explanation:
Since Dan has 20 rings and 9 hats out of which 5 hats are blue and 4 rings are red, there is a 5/9 x 4/20 chance that he will pick those two. When you simplify the fractions you get a 1/9 chance that Dan will choose such options.
9514 1404 393
Answer:
- DE ≈ 9.49, EF ≈ 8.06, FD ≈ 14.87
- obtuse scalene triangle
Step-by-step explanation:
For finding side lengths, it is convenient to work with the differences of the coordinates.
DE = E(-1, -3) -D(8, -6) = (-9, 3)
EF = F(-2, 5) -E(-1, -3) = (-1, 8)
FD = D(8, -6) -F(-2, 5) = (10, -11)
Then the lengths are ...
DE = √((-9)² +3²) = √90 = 3√10 ≈ 9.49
EF = √((-1)² +8²) = √65 ≈ 8.06
FD = √(10² +(-11)²) = √221 ≈ 14.87
The lengths are all different and the largest angle is obviously more than 90°, so the triangle is an obtuse scalene triangle.
In one hour the plane will cover a distance of 1238 km.
<h3>
What is a linear equation?</h3>
- A linear equation has one or two variables.
- No variable in a linear equation is raised to a power greater than 1.
- No variable is used as the denominator of a fraction.
- A linear equation is defined as an equation that is written in the form of ax+by=c.
- When solving the system of linear equations, we will get the values of the variable, which is called the solution of a linear equation.
solving this we will get the valve of Y is x is given.
calculation:-
today distance = 9904 km.
total time is taken = 8 hours.
∴total distance covered in one hour = 9904/8
= 1238 km.
Learn more about the equation here:- brainly.com/question/2972832
#SPJ2
Please see attached image for the graph.
a.
Yes, it is mathematically possible because the
degree of vertices for P=3, T=3, M=2, C=4, and R=2 and in Euler’s theorem, the
graph has to be connected, which in this case it is and the number of vertices
in the graph whose vertices is odd, is 0 or 2. And in this case, we have 2 that
have a degree of vertices that are odd, therefore mathematically this is
possible for the driver. The route would be P > R > C > M > T > C
> P > T.
b.
<span>It is mathematically possible. The router would be P
> C > R > T > M > C > T. Essentially, you travel each road
once.
</span>
c.
The driver would use a Hamiltonian circuit. The route
would be J > R > A > C > V > M > T > P > J.