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
I can’t show work but the answer is 3/5
Answer:
(-7, 1)
Step-by-step explanation:
Add the x and y values separately which is across from your screen to get the function which is (-7, 1).
Nonparametric tests are also called distribution-free tests because they don't assume that your data follow a specific distribution. You may have heard that you should use nonparametric tests when your data don't meet the assumptions of the parametric test, especially the assumption about normally distributed data.
Answer:
The answer is below
Step-by-step explanation:
The equation of a linear function is given as:
y = mx + b;
where y, x are variables, m is the rate of change and b is the initial value of variable y.
A) Since there is B bacteria in the Petri dish at 12:00 midnight and the number of bacteria increases after midnight by 25 every hour. Let h represent the time in hours and T represent the total number of bacteria, therefore the equation is:
T = 25h + B
B) Given that B = 5, h = 6, hence:
T = 25(6) + 5 = 150 + 5 = 155 bacteria
C) The equation of the graph is:
T = 25h + 5
The graph was plotted using geogebra online graphing.
