The following set of random numbers represents 20 simulations of 3 daily flights from philadelphia to seattle, with 0, 1, 2, or 3 representing a late departure and 4, 5, 6, 7, 8, or 9 representing an on-time departure. in how many of the simulations was there an on-time departure for all 3 flights?

506 619 535 769 096 380 527 555 737 192 092 658 694 320 442 812 968 763 374 282

a. 4
b. 3
c. 5
d. 6

It’s 4

Step-by-step explanation: There are 4 numbers in the list that don’t have a 0, 1, 2 or 3.

step-by-step explanation:

given that there are two triangles j'k'l' and jkl>

the former is got by dilating the second one.

when drawn on a grid, (graph paper) coordinates of vertices of first triangle is

(6,12)j, (9,6)k and (12,9)l

side jk has length = distance between j and k

=

side j'k'=distance between j' and k'

=

ie j'k'l' has sides 1/3 of that of corresponding sides of jkl.

hence scale factor of 1/3 is used to get j'k'l'from jkl

70.30

step-by-step explanation: