Answer:
The speed and time are directly proportional in that the higher the speed the lesser the time and vice versa.
The constant is the total distance which is 180 km
Step-by-step explanation:
Step one:
given data
The distance between the two cities is 180km
1.The distance was covered by a car at the rate of 50km/h
The time taken will be
velocity= distance/time
time= distance/velocity
time= 180/50
time= 3.6 hours
2.The distance was covered by a bus 45km/h
The time taken will be
velocity= distance/time
time= distance/velocity
time= 180/45
time= 4 hours
3.The distance was covered by a bicycle at 25km/h
The time taken will be
velocity= distance/time
time= distance/velocity
time= 180/25
time= 7.2 hours
Answer: 242 = 190 + 4t
Step-by-step explanation:
You know that the maximum capacity of the restaurant is 242 people, meaning that at most there can only be that many customers seated at that time. Normally, the equation would be 242 = 10b + 4t, but since you already know the number of booths, your work is cut in half, giving you 242 = 10(19) + 4t. The equation would be this because you have the capacity being equal to the number of tables x the number of people at each table and the number of booths x the number of people seated at each of them.
Answer:
in the pics
Step-by-step explanation:
In case you are wondering, I used the pythagorean theorem. If you want to learn how to use it I suggest you google it, there are plenty of sites that explain how to use it.
If you have any questions about the way I solved it, don't hesitate to ask me in the comments below :)
1. Find the centre of the circle or the midpoint of the two numbers
(6-6/2}, (-2+6/2)
(0, 2)
2. Find radius using the distance formula
√<span>(6 - 2)² + (-6 - 0)²
</span>√4² + (-6)²
√16 + 36
√52
r = 7.21
3. Plug in
x² + (y - 2)² = 52
So it is option D 99% sure
The path of the given Hamiltonian diagram is A, E, B, C, D, F. See explanation below.
<h3>What is a Hamiltonian Path?</h3>
A Hamiltonian path, also known as a traceable path, is one that visits each vertex of the graph precisely once.
A traceable graph is one that contains a Hamiltonian path.
Hence, the path is given as;
A, E, B, C, D, F
Learn more about Hamiltonian Paths at;
brainly.com/question/15521630
#SPJ1
