![Introduction To Statistics And Data Analysis](https://www.bartleby.com/isbn_cover_images/9781337793612/9781337793612_smallCoverImage.jpg)
Use the information in the previous exercise to answer the following questions.
- a. Construct a 90% confidence
interval estimate of the difference inmean Flesch reading ease score for health-related pages on Wikipedia and health-related pages on WebMD. - b. What does this confidence interval imply about the readability of health-related information from these two sources? Is this consistent with the conclusion in the hypothesis test of the previous exercise?
Many people now tum to the Internet to get information on health-related topics. The paper “An Examination of Health, Medical and Nutritional Information on the Internet: A Comparative Study of Wikipedia, WebMD and the Mayo Clinic Websites” (The International Journal of Communication and Health [2015]: 30–38) used Flesch reading ease scores (a measure of reading difficulty based on factors such as sentence length and number of syllables in the words used) to score pages on Wikipedia and on WebMD. Higher Flesch scores correspond to more difficult reading levels. The paper reported that for a representative sample of health-related pages on Wikipedia, the mean Flesch score was 26.7 and the standard deviation of the Flesch scores was 14.1. For a representative sample of pages from WebMD, the mean score was 43.9 and the standard deviation was 19.4. Suppose that these means and standard deviations were based on samples of 40 pages from each site. Is there convincing evidence that the mean reading level for health-related pages differs for Wikipedia and WebMD? Test the relevant hypotheses using a significance level of 0.05.
![Check Mark](/static/check-mark.png)
Want to see the full answer?
Check out a sample textbook solution![Blurred answer](/static/blurred-answer.jpg)
Chapter 11 Solutions
Introduction To Statistics And Data Analysis
- 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
- Glencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw HillCollege Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage LearningBig Ideas Math A Bridge To Success Algebra 1: Stu...AlgebraISBN:9781680331141Author:HOUGHTON MIFFLIN HARCOURTPublisher:Houghton Mifflin Harcourt
![Text book image](https://www.bartleby.com/isbn_cover_images/9780079039897/9780079039897_smallCoverImage.jpg)
![Text book image](https://www.bartleby.com/isbn_cover_images/9781305652231/9781305652231_smallCoverImage.gif)
![Text book image](https://www.bartleby.com/isbn_cover_images/9781680331141/9781680331141_smallCoverImage.jpg)