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:
10.D
Step-by-step explanation:
A=2(wl+hl+hw)
Answer:
sure if im able, with what?
Step-by-step explanation:
Answer:
7
Step-by-step explanation: (dont trust me)
x^2 + (7)x +18
x(x + 4) + 3(x + 6)
Answer:
If the equation is 3^x=n (it isnt showing up properly)
Part A: any number greater than 1 will work. Say 2.
Part B: any number less than or equal to 1.
Step-by-step explanation:
If you set x=2, 3^2=9 9>3
If you set x=0, 3^0=1 1<3