Answer:
118
Step-by-step explanation:
Answer:
last one
Step-by-step explanation:
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:
The correct pair of functions is the third one: h(x)=(x−24)^2 and g(x)=x2
Step-by-step explanation:
Example: If we have q(x) = x^2 and its graph, moving the vertex of this graph 24 units to the right results in r(x) = (x - 24)^2.
The correct pair of functions is the third one: h(x)=(x−24)^2 and g(x)=x2
Note: the fourth pair is incorrect, because the " + " sign moves the graph of x^2 24 units to the left.