Ask Question
11 September, 15:45

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. 11 September, 17:01
    0
    I think it's c that my answer
  2. 11 September, 18:42
    0
    I think answer is 18
Know the Answer?
Not Sure About the Answer?
Get 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 there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers