yes! what do you need?
Step-by-step explanation:
The first and only stop of the flight can be Boise, Omaha or Chicago. This means there are 3 possibilities where to stop. From thee the flight connects to New York City, either to La Guardia or to JFK Airport.
1 possible route: Seattle-Boise-La Guardia
<span>2 possible route: Seattle-Omaha-La Guardia
</span><span>3 possible route: Seattle-Chicago-La Guardia
</span><span>4 possible route: Seattle-Boise-NYC
</span><span>5 possible route: Seattle-Omaha-NYC
</span><span>6 possible route: Seattle-Chicago-NYC
</span>
Or in other words: There are two airports where the flight can arrive and for each of them there are three possible routes. So, in total there are 2*3=6 possible routes.
The first one. <_ means below and >_ means above. <_ and >_ means solid line < and > mean dotted line. i’m learning this in math right now
Answer:
30 miles
Step-by-step explanation:
20 x 3 is 60 minutes
10 x 3 is 30 miles
Answer:
= 3n + 3
Step-by-step explanation:
The sequence is arithmetic with explicit formula
= a₁ + (n - 1)d
where a₁ is the first term and d the common difference
From the recursive formula
a₁ = 6 and d = 3 [ the constant being added to A(n - 1) ] , then
= 6 + 3(n - 1) = 6 + 3n - 3 = 3n + 3
