1
$\begingroup$

A lock's combination consists of three digits. The first digit is a power of 2, the second digit is a prime number, and the last digit is a factor of 10. How many unique combinations fit this criteria?

The first digit is a power of 2, so $2^n$, which the possibilities is $n=\{0,1,2,3\}$ since a lock has numbers 0-9.

The second digit is a prime number so $\{2,3,5,7\}$

And the last digit is a factor of 10 so $\{1,2,5\}$.

Figured out my mistake.

$\endgroup$
2
$\begingroup$

There are four options for the first digit, four options for the second digit, and three options for the third digit. So there are $4 \cdot 4 \cdot 3 = 48$ possible combinations.

$\endgroup$
  • $\begingroup$ Wait so that was all? no need for the combination or permutation formulas? $\endgroup$ – Killercamin Feb 14 '17 at 21:07
  • 1
    $\begingroup$ @FernandoFernandez no need for those. It's just a simple application of the Multiplication Principle. $\endgroup$ – Harry Feb 14 '17 at 21:10
  • $\begingroup$ Thanks for the explanation and quick response $\endgroup$ – Killercamin Feb 14 '17 at 21:10
1
$\begingroup$

You're not rearranging anything, so you don't need permutations.

I'll pose a similar question: How many two-digit numbers have the first digit odd, and the second digit even?

There are five odd digits, and five even digits, so the total number of two-digit numbers that meet the criteria is $5 \times 5 = 25$.

Can you take it from here?

$\endgroup$
  • $\begingroup$ Yeah I just figured it out thanks $\endgroup$ – Killercamin Feb 14 '17 at 21:10

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.