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
Answer:
4
Step-by-step explanation:
Answer:49
Step by step is 56÷16=3.5
14x3.5=49
Your answer would be A. y = -3 + 4
the line intercepts the y axis at +4
and the line decreases 3 units down and one unit to the right which makes the slope ( rise over run) -3/1 but you would just say -3