Agame at the arcade gives timmy 3 tries for every 2 quarters he puts into the machine. if timmy uses 16 quarters to play this game, what is the greatest number of tries timmy will get?

1.677

step-by-step explanation:

i'm not good at explaining stuff but if you need an answer i'm here for you.

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

there are no choices to this, can you give us some choices so that i can answer it

step-by-step explanation: