Answer:
There can be 14,040,000 different passwords
Step-by-step explanation:
Number of permutations to order 3 letters and 2 numbers (total 5)
(AAANN, AANNA,AANAN,...)
= 5! / (3! 2!)
= 120 / (6*2)
= 10
For each permutation, the three distinct (English) letters can be arranged in
26!/(26-3)! = 26!/23! = 26*25*24 = 15600 ways
For each permutation, the two distinct digits can be arranged in
10!/(10-2)! = 10!/8! = 10*9 = 90 ways.
So the total number of distinct passwords is the product of all three permutations,
N = 10 * 15600 * 90 = 14,040,000
Answer:
The answer is x=57
Step-by-step explanation:
First, we would set the number to x.
Then, we turn the words into an equation.
x+75 = 3x-39
Isolate the x.
-2x = -114
So...
x = 57
The domain- Is the function provides an "output" or value for each member of the domain
Range- The difference between the lowest and highest values.
Answer:
Isolate the variable by dividing each side by factors that don't contain the variable.
n=5, -5
Answer:
-13 2/3
Step-by-step explanation:
-5 5/6 5x6= 30 4x5= 20
+ 20/30= 2/3
-8 4/5
----------- -5 + -8 = -13
-13 2/3
hope this helps
