Concept explainers
Straight or boxed? Consider a Pick-3 lottery such as the one described in Exercise 6.7. Suppose your birthday is May 14, and like many people, you decide to bet $1 on your birthday number (i.e., 514) on your birthday. There are two options to play, straight or boxed. If you choose to play straight, you win $500 if and only if the number chosen is 514. If you choose to play boxed, you win $80 if the number chosen contains the digits 5, 1, and 4 in any order. Which option would you prefer to play and why?
6.7 Playing the lottery The state of Ohio has several statewide lottery options. One is the Pick 3 game in which you pick one of the 1000 three-digit numbers between 000 and 999. The lottery selects a three-digit number at random. With a bet of $1, you win $500 if your number is selected and nothing ($0) otherwise. (Many states have a very similar type of lottery.) (Source: Background information from www.ohiolottery.com.)
- a. With a single $1 bet, what is the
probability that you win $500? - b. Let X denote your winnings for a $1 bet, so x = $0 or x = $500. Construct the probability distribution for X.
- c. Show that the
mean of the distribution equals 0.50, corresponding to an expected return of 50 cents for the dollar paid to play. Interpret the mean. - d. In Ohio’s Pick 4 lottery, you pick one of the 10,000 four-digit numbers between 0000 and 9999 and (with a $1 bet) win $5000 if you get it correct. In terms of your expected winnings, with which game are you better off—playing Pick 4, or playing Pick 3? Justify your answer.
Want to see the full answer?
Check out a sample textbook solutionChapter 6 Solutions
Statistics, Books a la Carte Edition Plus MyLab Statistics with Pearson eText -- Access Card Package (4th Edition)
- solve the question based on hw 1, 1.41arrow_forwardT1.4: Let ẞ(G) be the minimum size of a vertex cover, a(G) be the maximum size of an independent set and m(G) = |E(G)|. (i) Prove that if G is triangle free (no induced K3) then m(G) ≤ a(G)B(G). Hints - The neighborhood of a vertex in a triangle free graph must be independent; all edges have at least one end in a vertex cover. (ii) Show that all graphs of order n ≥ 3 and size m> [n2/4] contain a triangle. Hints - you may need to use either elementary calculus or the arithmetic-geometric mean inequality.arrow_forwardWe consider the one-period model studied in class as an example. Namely, we assumethat the current stock price is S0 = 10. At time T, the stock has either moved up toSt = 12 (with probability p = 0.6) or down towards St = 8 (with probability 1−p = 0.4).We consider a call option on this stock with maturity T and strike price K = 10. Theinterest rate on the money market is zero.As in class, we assume that you, as a customer, are willing to buy the call option on100 shares of stock for $120. The investor, who sold you the option, can adopt one of thefollowing strategies: Strategy 1: (seen in class) Buy 50 shares of stock and borrow $380. Strategy 2: Buy 55 shares of stock and borrow $430. Strategy 3: Buy 60 shares of stock and borrow $480. Strategy 4: Buy 40 shares of stock and borrow $280.(a) For each of strategies 2-4, describe the value of the investor’s portfolio at time 0,and at time T for each possible movement of the stock.(b) For each of strategies 2-4, does the investor have…arrow_forward
- Negate the following compound statement using De Morgans's laws.arrow_forwardNegate the following compound statement using De Morgans's laws.arrow_forwardQuestion 6: Negate the following compound statements, using De Morgan's laws. A) If Alberta was under water entirely then there should be no fossil of mammals.arrow_forward
- Negate the following compound statement using De Morgans's laws.arrow_forwardCharacterize (with proof) all connected graphs that contain no even cycles in terms oftheir blocks.arrow_forwardLet G be a connected graph that does not have P4 or C3 as an induced subgraph (i.e.,G is P4, C3 free). Prove that G is a complete bipartite grapharrow_forward
- Prove sufficiency of the condition for a graph to be bipartite that is, prove that if G hasno odd cycles then G is bipartite as follows:Assume that the statement is false and that G is an edge minimal counterexample. That is, Gsatisfies the conditions and is not bipartite but G − e is bipartite for any edge e. (Note thatthis is essentially induction, just using different terminology.) What does minimality say aboutconnectivity of G? Can G − e be disconnected? Explain why if there is an edge between twovertices in the same part of a bipartition of G − e then there is an odd cyclearrow_forwardLet G be a connected graph that does not have P4 or C4 as an induced subgraph (i.e.,G is P4, C4 free). Prove that G has a vertex adjacent to all othersarrow_forwardWe consider a one-period market with the following properties: the current stock priceis S0 = 4. At time T = 1 year, the stock has either moved up to S1 = 8 (with probability0.7) or down towards S1 = 2 (with probability 0.3). We consider a call option on thisstock with maturity T = 1 and strike price K = 5. The interest rate on the money marketis 25% yearly.(a) Find the replicating portfolio (φ, ψ) corresponding to this call option.(b) Find the risk-neutral (no-arbitrage) price of this call option.(c) We now consider a put option with maturity T = 1 and strike price K = 3 onthe same market. Find the risk-neutral price of this put option. Reminder: A putoption gives you the right to sell the stock for the strike price K.1(d) An investor with initial capital X0 = 0 wants to invest on this market. He buysα shares of the stock (or sells them if α is negative) and buys β call options (orsells them is β is negative). He invests the cash balance on the money market (orborrows if the amount is…arrow_forward
- Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:CengageHolt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGALCollege Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning