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
Only one that would make sense is 1/12
Answer:
the answer is B
Step-by-step explanation:
Each mark represents 20%, you move right three times. 20x3 = 60
60%
Answer:
1 is $1.50
8 is $10.50
Step-by-step explanation:
The sequence is +$3.00
Answer:
total amount donated when aaron walks n miles = $2 + $3(n-1)
Step-by-step explanation:
Aaron participates in a walkathon for charity. He has a sponsor who has pledged a base donation of $2 for the first mile he walks and then a certain dollar amount for each additional mile he walks. Based on this pledge, if Aaron walks 8 miles, the sponsor will donate a total of $23 to the charity.
Write a formula that can be used to determine the amount of money this sponsor donates when Aaron walks n miles.
total amount sponsor pays = base donations + (additional miles walked after first mile x amount paid)
when Aaron walks 8 miles
additional miles = 8 - 1 = 7
23 = 2 + 7x
23 - 2 = 7x
x = 3
additional amount paid is $3
total amount donated when aaron walks n miles = $2 + $3(n-1)
