Solve for n :
N=9
...........
Answer:
answer is 1/8
Step-by-step explanation:
hope this helps
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:
80
Step-by-step explanation:
-4f(x)=-12x+44
-4f(-3)=36+44=80
We can figure out how many numbers there are from 368 to 500 by subtracting.
500 - 368 = 132
Now, we need to get it in word form. This can be done by looking at the place value of each number.. So your answer would be:
1 hundred, 3 tens, and 2 ones.