Suppose you want to simulate something with a 16% (4 in 25) chance of success. The most efficient way to simulate that with whole numbers would be to generate the numbers from 1 to , and arbitrarily choose number(s) to represent a "success."

25

6, 12, 18, 24 (Any four numbers from 1 to 25 would be correct)

Step-by-step explanation:

The most effective way to this with whole numbers is to find an irreducible fraction that represents 16%. Coincidentally, we were already given that 16% represents a 4 in 25 chance, which is an irreducible fraction.

Therefore, the most efficient way to do it is to generate numbers from 1 to 25, and then arbitrarily choose any four numbers (i.e. 6, 12, 18, 24) within that range to represent a success.

can you add an image ?

step-by-step explanation:

solution:

→c= a b , that is product of a and b is possible only when when a is m × n matrix and b is n × p matrix.

that is, number of columns of a= number of rows of b.

so, size of matrix , c= a b is , if a = (m × n)matrix

b= (n × p)matrix

then a b = [ (m × n)matrix] ×[   (n × p)matrix ]

→→c= a b= [m × p ] matrix

→→size of product a b will be equal to = number of rows of a × number of columns of b