The restaurant needs at least 761 forks.
There are currently 205 forks
Each set on sale contains 10 forks,
The number of set taht have to buy are x
Number of forks in x set are = 10x
Since, we need at least 761
So 761 should be graeter than equal to the sum of reamining forks and the new forks
i.e. 761 ≥ 10x + 205
Answer : 3. 761 ≥ 10x + 205
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
Use the website math papa it’ll give you the answers for your problem I promise!! Have a good day :)
Multiply all of them together.10*9*8 and so on...
3,628,800 ways !
The variables are the number of handbags and the time.