Suppose the matrix represents a railroad map between cities 1, 2, 3, 4, and 5.
=
⎣ ⎢ ⎢ ⎢ ⎡
0 1 2 1 1
2 0
1 1
1 1
0 2
02
1 1
1 1
0 0
3 0
20
⎦ ⎥ ⎥ ⎥ ⎤
a. how many different ways can you travel from city 1 to city 3 with exactly one connection?
b. how many different ways can you travel from city 1 to city 5 with exactly one connection?
c. how many different ways can you travel from city 2 to city 5 with exactly one connection?

0.16 or 16%

step-by-step explanation:

lets take a coin for example.

if you toss it twice, it has a 1/4 chance of landing on heads both times because 1/2 * 1/2 is 1/4.

with the cards, the chance of picking dog is 0.4. having two people pick one is like picking a card twice in a row. so 0.4 * 0.4 is 0.16, or 16%

sina-sinb

cosb+cosa

tana-tanb

cos0+cos x pi/3

20tan

step-by-step explanation:

current in the circuit at time t is /, then the power delivered to the resistor is

step-by-step explanation:

on the middle line

step-by-step explanation:

1/5=50