A numerical pass code is required to open a car door. The pass code is five digits long and uses the digits 0-9. Numbers may be repeated in the pass code. How many different pass codes exist?
3,125
10.000
59,049
100,000

step-by-step explanation:

12475909

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

it has the same slope and a different y-intercept

hope this : )