Answer:
Step-by-step explanation:
<u>Equation Solving</u>
We are given the equation:
It's required to solve the equation for D. All letters must preserve their capitalization.
We must isolate the letter D by removing from the left side all the terms and coefficients that surround it.
Adding 7:
Dividing by f:
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
To solve both of these expressions, we want to add or subtract from left to right.
For the first one, we can rewrite it as:
8-6-9
=2-9
=-7
The second one we can rewrite as:
5-7+9+8-4
=-2+9+8-4
=7+8-4
=15-4
=11
