.0003, .04, .02, 2 now i need to type more do i cam be more than 20 characters
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:
Last Option
Step-by-step explanation:
We have a triangle and we know its three sides.
We want to find one of your anguos. Then we use the cosine theorem.

Where

Now we solve for x from the equation

Answer:
x + 3 = 0.
Step-by-step explanation:
One would be:
x + 3 = 0 Subtract 3 from both sides:
x + 3 - 3 = 0 - 3
x = -3
3y+21+8y
11y+21 is the answer