Answer:
-2480
Step-by-step explanation:
31 * -80 =-2480
Not sure how to explain this more, but I hope this helps!
Answer:
B. {1, -4}
Step-by-step explanation:
Just rotate the screen and look at the position.
Answer:
The probability is 
Step-by-step explanation:
If she has n distinct password candidates and only one of which will successfully log her into a secure system, the probability that her first first successful login will be on her k-th try is:
If k=1

Because, in her first try she has n possibles options and just one give her a successful login.
If k=2

Because, in her first try she has n possibles options and n-1 that are not correct, then, she has n-1 possibles options and 1 of that give her a successful login.
If k=3

Because, in her first try she has n possibles options and n-1 that are not correct, then, she has n-1 possibles options and n-2 that are not correct and after that, she has n-2 possibles options and 1 give her a successful login.
Finally, no matter what is the value of k, the probability that her first successful login will be (exactly) on her k-th try is 1/n
First, square both sides (d.) leaving 3x + 1 = 16
Second, subtract 1 from both sides (a.) leaving 3x = 15
Third, divide by 3 from both sides (e.) leaving x = 5
Answer: First D, then A, then E
9514 1404 393
Answer:
x^2 +4x -21
Step-by-step explanation:
Substitute the given expressions and simplify.
f(x) + g(x)
= (x^2 +3x -28) +(x +7)
= x^2 +(3+1)x +(-28 +7)
= x^2 +4x -21