Question

In: Statistics and Probability

Suppose a pizzeria called Sticky Dough gets an order for 5 pizzas to be delivered to...

Suppose a pizzeria called Sticky Dough gets an order for 5 pizzas to be delivered to some VIP. This customer has an evil reputation for being extremely picky and there is only a 60% chance that he’ll accept any particular pizza. Because this is an important gig for Sticky Dough, they decide to send extra pizzas in case some are rejected. What is the minimum number of pizzas that will have to be sent to be 95% sure that at least 5 will be accepted?

Solutions

Expert Solution


Related Solutions

A gourmet pizzeria delivered the following quantities (pizzas) over the past 12 months in 2018: Jan...
A gourmet pizzeria delivered the following quantities (pizzas) over the past 12 months in 2018: Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec 3,300 3,500 3,450 3,600 3,700 3,750 3,700 3,750 3,950 3,950 4,100 4,250 November 4,100 December 4,250 The average monthly operating cost, including delivery, can be categorized as follows: Direct Labor = $14,500 Material = $4,000 Overhead = $5,500 In the past three 3 months (October through December), the pizzeria collected information regarding customer...
Suppose you receive an order for 150 pieces in period 4 that has to be delivered...
Suppose you receive an order for 150 pieces in period 4 that has to be delivered in period 5 and when you check your MPS you discover that in that period you only have 60 units available to promise and your next batch (300 units) it's scheduled to arrive in Period 6 and preparation time is 3 weeks. What actions can you take to resolve this situation? What are the limitations of the requirements that must be considered? What should...
Problem 3 (5 marks). Suppose elements a[i] and a[i+k] are in the wrong order and we...
Problem 3 . Suppose elements a[i] and a[i+k] are in the wrong order and we swap them. Prove that this will remove at least 1 inversion but at most 2k − 1 inversions. (This is textbook problem 7.3.) Further explain why both the lower bound of 1 and the upper bound of 2k − 1 can be attained for any i, k, where k > 0.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT