Ask Question
2 July, 06:49

Suppose that a "code" consists of 4 digits, none of which are repeated. (a digit is one of the 10 numbers 0,1,2,3,4,5,6,7,8,9) how many codes are possible?

+5
Answers (1)
  1. 2 July, 08:17
    0
    The answer is 5040.

    This is permutation without the repetition:

    P = n! / (n - r) !

    n - the number of choices

    r - the number of chosen

    We have:

    n = 10

    r = 4

    P = 10! / (10 - 4) !

    = 10!/6!

    = (10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1) / (6 * 5 * 4 * 3 * 2 * 1)

    = 10 * 9 * 8 * 7

    = 5040
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “Suppose that a "code" consists of 4 digits, none of which are repeated. (a digit is one of the 10 numbers 0,1,2,3,4,5,6,7,8,9) how many ...” in 📘 Mathematics if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers