Two friends argue over who brushes their teeth more often. To settle the argument, they keep track of the number of mornings and nights they brush and calculate a probability. These are shown in the table.

the number of possible outcomes that do not show a 1 on the first spinner and show the number 4 on the second spinner is 2.

spinner 1 spinner 2

1                     1

1                     2

1                     3

1                     4

2                   1

2                   2

2                   3

2                   4   = not 1, and 4

3                   1

3                   2

3                   3

3                   4 = not 1, and 4

only 2 outcomes have passed the given condition.

step-by-step explanation:

explanation:

previous steps have made pa≅ pb ≅ st ≅ su. setting the compass width to ab allows you to make tu the same length. then δstu ≅ δpab by the sss congruence postulate, and ∠p ≅ ∠s by the reason cpctc.