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
<h3>
Answer: Only first two are exponential growth function and last three functions are exponential decay functions.</h3>
Step-by-step explanation: We need to describe exponential growth or decay for the given functions.
The standard exponential function equation is
.
Where a is the initial value and b is the growth factor.
Note: If value of b > 1, it would be an exponential growth and if b < 1, it would be an exponential decay.
Let us check them one by one.
=> 
=>
.
Value of b is 1.008 > 1, therefor it's an exponential growth function.
y=250(1+0.004)^t, also have b>1 therefor it's an exponential growth function.
All other functions has b values less than 1, therefore only first two are exponential growth function and last three functions are exponential decay functions.
Answer:
75 cents
Step-by-step explanation:
By pythagorean thoerm u can find
Hy^2=length^2+base^2