Concept explainers
Over the past few years the percentage of students who leave Lakeland College at the end of the first year has increased. Last year Lakeland started a voluntary one-week orientation program to help first-year students adjust to campus life. If Lakeland is able to show that the orientation program has a positive effect on retention, they will consider making the program a requirement for all first-year students. Lakeland’s administration also suspects that students with lower GPAs have a higher
Student | GPA | Program | Return |
1 | 3.78 | 1 | 1 |
2 | 2.38 | 0 | 1 |
3 | 1.30 | 0 | 0 |
4 | 2.19 | 1 | 0 |
5 | 3.22 | 1 | 1 |
6 | 2.68 | 1 | 1 |
. | . | . | . |
. | . | . | . |
. | . | . | . |
98 | 2.57 | 1 | 1 |
99 | 1.70 | 1 | 1 |
100 | 3.85 | 1 | 1 |
The dependent variable was coded as y = 1 if the student returned to Lakeland for the sophomore year and y = 0 if not. The two independent variables are:
x1 = GPA at the end of the first semester
- a. Write the logistic regression equation relating x1 and x2 to y.
- b. What is the interpretation of E(y) when x2 = 0?
- c. Use both independent variables and Minitab to compute the estimated logit.
- d. Conduct a test for overall significance using α = .05.
- e. Use α = .05 to determine whether each of the independent variables is significant.
- f. Use the estimated logit computed in part (c) to estimate the probability that students with a 2.5 grade point average who did not attend the orientation program will return to Lakeland for their sophomore year. What is the estimated probability for students with a 2.5 grade point average who attended the orientation program?
- g. What is the estimated odds ratio for the orientation program? Interpret it.
- h. Would you recommend making the orientation program a required activity? Why or why not?
Trending nowThis is a popular solution!
Chapter 15 Solutions
Statistics for Business & Economics, Revised (with XLSTAT Education Edition Printed Access Card)
- 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
- Glencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw HillCollege Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning
- Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGALBig Ideas Math A Bridge To Success Algebra 1: Stu...AlgebraISBN:9781680331141Author:HOUGHTON MIFFLIN HARCOURTPublisher:Houghton Mifflin Harcourt