OPENINTRO:STATISTICS
4th Edition
ISBN: 9781943450077
Author: OPENINTRO
Publisher: amazon.com
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Question
Chapter 3.1, Problem 15GP
a)
To determine
Find the
b)
To determine
Find the probability that the loan took either of the given attributes using Venn diagram in Exercise 3.14.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Twenty-eight applicants interested in working for the Food Stamp program took an examination designed
to measure their aptitude for social work. A stem-and-leaf plot of the 28 scores appears below, where the
first column is the count per branch, the second column is the stem value, and the remaining digits are the
leaves.
a) List all the values.
Count
1
Stems
Leaves
4
6
1
4
6
567
9
3688
026799
9
8
145667788
7
9
1234788
b) Calculate the first quartile (Q1) and the third Quartile (Q3).
c) Calculate the interquartile range.
d) Construct a boxplot for this data.
Pam, Rob and Sam get a cake that is one-third chocolate, one-third vanilla, and one-third strawberry as shown below. They wish to fairly divide the cake using the lone chooser method. Pam likes strawberry twice as much as chocolate or vanilla. Rob only likes chocolate. Sam, the chooser, likes vanilla and strawberry twice as much as chocolate. In the first division, Pam cuts the strawberry piece off and lets Rob choose his favorite piece. Based on that, Rob chooses the chocolate and vanilla parts. Note: All cuts made to the cake shown below are vertical.Which is a second division that Rob would make of his share of the cake?
Three players (one divider and two choosers) are going to divide a cake fairly using the lone divider method. The divider cuts the cake into three slices (s1, s2, and s3).
If the choosers' declarations are Chooser 1: {s1 , s2} and Chooser 2: {s2 , s3}.
Using the lone-divider method, how many different fair divisions of this cake are possible?
Chapter 3 Solutions
OPENINTRO:STATISTICS
Ch. 3.1 - Prob. 6GPCh. 3.1 - Prob. 7GPCh. 3.1 - Prob. 8GPCh. 3.1 - Prob. 9GPCh. 3.1 - Prob. 10GPCh. 3.1 - Prob. 11GPCh. 3.1 - Prob. 12GPCh. 3.1 - Prob. 13GPCh. 3.1 - Prob. 14GPCh. 3.1 - Prob. 15GP
Ch. 3.1 - Prob. 16GPCh. 3.1 - Prob. 17GPCh. 3.1 - Prob. 18GPCh. 3.1 - Prob. 19GPCh. 3.1 - Prob. 20GPCh. 3.1 - Prob. 22GPCh. 3.1 - Prob. 23GPCh. 3.1 - Prob. 24GPCh. 3.1 - Prob. 1ECh. 3.1 - Prob. 2ECh. 3.1 - Prob. 3ECh. 3.1 - Prob. 4ECh. 3.1 - Prob. 5ECh. 3.1 - Prob. 6ECh. 3.1 - Prob. 7ECh. 3.1 - Prob. 8ECh. 3.1 - Prob. 9ECh. 3.1 - Prob. 10ECh. 3.1 - Prob. 11ECh. 3.1 - Prob. 12ECh. 3.2 - Prob. 28GPCh. 3.2 - Prob. 29GPCh. 3.2 - Prob. 30GPCh. 3.2 - Prob. 31GPCh. 3.2 - Prob. 32GPCh. 3.2 - Prob. 33GPCh. 3.2 - Prob. 35GPCh. 3.2 - Prob. 36GPCh. 3.2 - Prob. 37GPCh. 3.2 - Prob. 38GPCh. 3.2 - Prob. 39GPCh. 3.2 - Prob. 41GPCh. 3.2 - Prob. 43GPCh. 3.2 - Prob. 45GPCh. 3.2 - Prob. 46GPCh. 3.2 - Prob. 13ECh. 3.2 - Prob. 14ECh. 3.2 - Prob. 15ECh. 3.2 - Prob. 16ECh. 3.2 - Prob. 17ECh. 3.2 - Prob. 18ECh. 3.2 - Prob. 19ECh. 3.2 - Prob. 20ECh. 3.2 - Prob. 21ECh. 3.2 - Prob. 22ECh. 3.3 - Prob. 49GPCh. 3.3 - Prob. 51GPCh. 3.3 - Prob. 52GPCh. 3.3 - Prob. 53GPCh. 3.3 - Prob. 23ECh. 3.3 - Prob. 24ECh. 3.3 - Prob. 25ECh. 3.3 - Prob. 26ECh. 3.3 - Prob. 27ECh. 3.3 - Prob. 28ECh. 3.4 - Prob. 55GPCh. 3.4 - Prob. 59GPCh. 3.4 - Prob. 62GPCh. 3.4 - Prob. 63GPCh. 3.4 - Prob. 64GPCh. 3.4 - Prob. 66GPCh. 3.4 - Prob. 67GPCh. 3.4 - Prob. 69GPCh. 3.4 - Prob. 70GPCh. 3.4 - Prob. 29ECh. 3.4 - Prob. 30ECh. 3.4 - Prob. 31ECh. 3.4 - Prob. 32ECh. 3.4 - Prob. 33ECh. 3.4 - Prob. 34ECh. 3.4 - Prob. 35ECh. 3.4 - Prob. 36ECh. 3.5 - Prob. 73GPCh. 3.5 - Prob. 75GPCh. 3.5 - Prob. 37ECh. 3.5 - Prob. 38ECh. 3 - Prob. 39CECh. 3 - Prob. 40CECh. 3 - Prob. 41CECh. 3 - Prob. 42CECh. 3 - Prob. 43CECh. 3 - Prob. 44CECh. 3 - Prob. 45CECh. 3 - Prob. 46CECh. 3 - Prob. 47CE
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, statistics and related others by exploring similar questions and additional content below.Similar questions
- Theorem 2.6 (The Minkowski inequality) Let p≥1. Suppose that X and Y are random variables, such that E|X|P <∞ and E|Y P <00. Then X+YpX+Yparrow_forwardTheorem 1.2 (1) Suppose that P(|X|≤b) = 1 for some b > 0, that EX = 0, and set Var X = 0². Then, for 0 0, P(X > x) ≤e-x+1²² P(|X|>x) ≤2e-1x+1²² (ii) Let X1, X2...., Xn be independent random variables with mean 0, suppose that P(X ≤b) = 1 for all k, and set oσ = Var X. Then, for x > 0. and 0x) ≤2 exp Σ k=1 (iii) If, in addition, X1, X2, X, are identically distributed, then P(S|x) ≤2 expl-tx+nt²o).arrow_forwardTheorem 5.1 (Jensen's inequality) state without proof the Jensen's Ineg. Let X be a random variable, g a convex function, and suppose that X and g(X) are integrable. Then g(EX) < Eg(X).arrow_forward
- Can social media mistakes hurt your chances of finding a job? According to a survey of 1,000 hiring managers across many different industries, 76% claim that they use social media sites to research prospective candidates for any job. Calculate the probabilities of the following events. (Round your answers to three decimal places.) answer parts a-c. a) Out of 30 job listings, at least 19 will conduct social media screening. b) Out of 30 job listings, fewer than 17 will conduct social media screening. c) Out of 30 job listings, exactly between 19 and 22 (including 19 and 22) will conduct social media screening. show all steps for probabilities please. answer parts a-c.arrow_forwardQuestion: we know that for rt. (x+ys s ا. 13. rs. and my so using this, show that it vye and EIXI, EIYO This : E (IX + Y) ≤2" (EIX (" + Ely!")arrow_forwardTheorem 2.4 (The Hölder inequality) Let p+q=1. If E|X|P < ∞ and E|Y| < ∞, then . |EXY ≤ E|XY|||X|| ||||qarrow_forward
- Theorem 7.6 (Etemadi's inequality) Let X1, X2, X, be independent random variables. Then, for all x > 0, P(max |S|>3x) ≤3 max P(S| > x). Isk≤narrow_forwardTheorem 7.2 Suppose that E X = 0 for all k, that Var X = 0} x) ≤ 2P(S>x 1≤k≤n S√2), -S√2). P(max Sk>x) ≤ 2P(|S|>x- 1arrow_forwardThree players (one divider and two choosers) are going to divide a cake fairly using the lone divider method. The divider cuts the cake into three slices (s1, s2, and s3).If the chooser's declarations are Chooser 1: {s3} and Chooser 2: {s3}, which of the following is a fair division of the cake?arrow_forwardTheorem 1.4 (Chebyshev's inequality) (i) Suppose that Var X x)≤- x > 0. 2 (ii) If X1, X2,..., X, are independent with mean 0 and finite variances, then Στη Var Xe P(|Sn| > x)≤ x > 0. (iii) If, in addition, X1, X2, Xn are identically distributed, then nVar Xi P(|Sn> x) ≤ x > 0. x²arrow_forwardTheorem 2.5 (The Lyapounov inequality) For 0arrow_forwardTheorem 1.6 (The Kolmogorov inequality) Let X1, X2, Xn be independent random variables with mean 0 and suppose that Var Xk 0, P(max Sk>x) ≤ Isk≤n Σ-Var X In particular, if X1, X2,..., X, are identically distributed, then P(max Sx) ≤ Isk≤n nVar X₁ x2arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_iosRecommended textbooks for you
Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGAL
Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGALAlgebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
Mod-01 Lec-01 Discrete probability distributions (Part 1); Author: nptelhrd;https://www.youtube.com/watch?v=6x1pL9Yov1k;License: Standard YouTube License, CC-BY
Discrete Probability Distributions; Author: Learn Something;https://www.youtube.com/watch?v=m9U4UelWLFs;License: Standard YouTube License, CC-BY
Probability Distribution Functions (PMF, PDF, CDF); Author: zedstatistics;https://www.youtube.com/watch?v=YXLVjCKVP7U;License: Standard YouTube License, CC-BY
Discrete Distributions: Binomial, Poisson and Hypergeometric | Statistics for Data Science; Author: Dr. Bharatendra Rai;https://www.youtube.com/watch?v=lHhyy4JMigg;License: Standard Youtube License