How many 3-digit numerical passwords are there if a digit cannot be repeated?
1 answer:
The first digit of the password can be any of the ten digits - 10 possibilities.
A digit cannot be repeated, so the second digit can be any digit except the one you chose for the first digit - 9 possibilities.
The third digit can be any digit except the digits you chose for the first and second digit - 8 possibilities.
Using the rule of product:
There are 720 passwords.
A digit cannot be repeated, so the second digit can be any digit except the one you chose for the first digit - 9 possibilities.
The third digit can be any digit except the digits you chose for the first and second digit - 8 possibilities.
Using the rule of product:
There are 720 passwords.
You might be interested in
I believe the equation is
![4 \sqrt[4]{2x} + 6 \sqrt[4]{2x}](https://tex.z-dn.net/?f=4%20%5Csqrt%5B4%5D%7B2x%7D%20%2B%206%20%20%5Csqrt%5B4%5D%7B2x%7D%20)
In this case, you would simplify it by adding them together.
= ![10 \sqrt[4]{2x}](https://tex.z-dn.net/?f=10%20%20%5Csqrt%5B4%5D%7B2x%7D%20)
And can even be changed to an exponential equation:
In this case, you would simplify it by adding them together.
And can even be changed to an exponential equation: