Answer: 2
Step-by-step explanation:
I need more to answer that can you maybe zoom out
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
The correct answer is: [A]: " <span>x(y – 5) = 2 " .
</span>_____________________________________________________
Consider:
_____________________________________________________
Choice: [A]: " x(y–5) = 2 " ;
Divide each side by "x" ;
" [x(y – 5)] / x = 2/x " ;
→ y – 5 = 2/x ;
Add "5" to each side of the equation:
y – 5 + 5 = 2/x + 5 ;
→ y = 2/x + 5 ; not a line; since one cannot divide by "zero" ; there would be no "point" on the graph at "x = 0". So, this answer choice: [A] is correct.
_______________________________________________________
Choice [B]:
y -2x -18 = 0
y - 2x = 18
y = 18 + 2x ; y = 2x + 18 ; is a line.
_________________________________________________
Choice C) 3y + 12 - 6x = 5 ;
3y = 5 - 12 + 6x ;
3y = -7 + 6x ; 3y = 6x - 7 ; y = 6x/3 - 7/3 ; y = 2x - 7/3 ; is a line.
_________________________________________________
Choice: [D]:
2(y+x) = 0 ;
[2*(y+x)] / 2 = 0/2 ; y + x = 0 ; y = -x ; is a line.
_________________________________________________
Answer:
Your answer is -3
Step-by-step explanation:
I had this on a test and i got it
plz mark brainliest
