Ask Question
3 July, 07:16

Which multiplication problem can be used to determine how many possible combinations there are for a lock

consisting of 3 digits from 0-9, if the digits can be repeated?

(3) (3) (3)

O (9/9/9)

O (10/9/8)

(10/10/10)

Intro

Done

4 of 11

+1
Answers (2)
  1. 3 July, 07:31
    0
    I think answer is 18
  2. 3 July, 07:44
    0
    I think it's c that my answer
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “Which multiplication problem can be used to determine how many possible combinations there are for a lock consisting of 3 digits from 0-9, ...” in 📗 Mathematics if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers