Mathematical Stat I: solutions of homework 1

Similar documents
PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com)

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a

1 Graph Sparsfication

The isoperimetric problem on the hypercube

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

2 X = 2 X. The number of all permutations of a set X with n elements is. n! = n (n 1) (n 2) nn e n

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals

Counting Regions in the Plane and More 1

Area As A Limit & Sigma Notation

Alpha Individual Solutions MAΘ National Convention 2013

Homework 1 Solutions MA 522 Fall 2017

15-859E: Advanced Algorithms CMU, Spring 2015 Lecture #2: Randomized MST and MST Verification January 14, 2015

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

5.3 Recursive definitions and structural induction

University of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures

CS200: Hash Tables. Prichard Ch CS200 - Hash Tables 1

1.2 Binomial Coefficients and Subsets

The golden search method: Question 1

condition w i B i S maximum u i

Solution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:

Lecture 9: Exam I Review

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)

. Written in factored form it is easy to see that the roots are 2, 2, i,

Module 8-7: Pascal s Triangle and the Binomial Theorem

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

Recursive Estimation

EVALUATION OF TRIGONOMETRIC FUNCTIONS

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4

Examples and Applications of Binary Search

CMPT 125 Assignment 2 Solutions

Arithmetic Sequences

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein

Lecture 5. Counting Sort / Radix Sort

Big-O Analysis. Asymptotics

Civil Engineering Computation

3D Model Retrieval Method Based on Sample Prediction

DATA STRUCTURES. amortized analysis binomial heaps Fibonacci heaps union-find. Data structures. Appetizer. Appetizer

Big-O Analysis. Asymptotics

On (K t e)-saturated Graphs

Some non-existence results on Leech trees

Test 4 Review. dy du 9 5. sin5 zdz. dt. 5 Ê. x 2 È 1, 3. 2cos( x) dx is less than using Simpson's. ,1 t 5 t 2. ft () t2 4.

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics

Lecture 1: Introduction and Strassen s Algorithm

Computational Geometry

Random Graphs and Complex Networks T

Ones Assignment Method for Solving Traveling Salesman Problem

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Project 2.5 Improved Euler Implementation

3. b. Present a combinatorial argument that for all positive integers n : : 2 n

Which movie we can suggest to Anne?

The Adjacency Matrix and The nth Eigenvalue

Parabolic Path to a Best Best-Fit Line:

Abstract. Chapter 4 Computation. Overview 8/13/18. Bjarne Stroustrup Note:

Section 7.2: Direction Fields and Euler s Methods

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Numerical Methods Lecture 6 - Curve Fitting Techniques

Normal Distributions

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5.

Some cycle and path related strongly -graphs

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.

Protected points in ordered trees

c-dominating Sets for Families of Graphs

Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms

CIS 121. Introduction to Trees

Lecture 10 Collision resolution. Collision resolution

Ch 9.3 Geometric Sequences and Series Lessons

CONTINUI TY. JEE-Mathematics. Illustration 1 : Solution : Illustration 2 : 1. CONTINUOUS FUNCTIONS :

prerequisites: 6.046, 6.041/2, ability to do proofs Randomized algorithms: make random choices during run. Main benefits:

Integration: Reduction Formulas Any positive integer power of sin x can be integrated by using a reduction formula.

Math 3201 Notes Chapter 4: Rational Expressions & Equations

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13

Major CSL Write your name and entry no on every sheet of the answer script. Time 2 Hrs Max Marks 70

New Results on Energy of Graphs of Small Order

The number n of subintervals times the length h of subintervals gives length of interval (b-a).

Intro to Scientific Computing: Solutions

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Math Section 2.2 Polynomial Functions

Lecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions

Computer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

Data Structures Week #9. Sorting

How do we evaluate algorithms?

SEQUENCES AND SERIES

Perhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where

Σ P(i) ( depth T (K i ) + 1),

n Maurice Wilkes, 1949 n Organize software to minimize errors. n Eliminate most of the errors we made anyway.

Lecture 2: Spectra of Graphs

Package popkorn. R topics documented: February 20, Type Package

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

Combination Labelings Of Graphs

CS 683: Advanced Design and Analysis of Algorithms

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1

Pattern Recognition Systems Lab 1 Least Mean Squares

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

MR-2010I %MktBSize Macro 989. %MktBSize Macro

A study on Interior Domination in Graphs

Transcription:

Mathematical Stat I: solutios of homework Name: Studet Id N:. Suppose we tur over cards simultaeously from two well shuffled decks of ordiary playig cards. We say we obtai a exact match o a particular tur if the same card appears from each deck; for example, the quee of spades agaist the quee of spades. Let equal the probability of at least oe exact match. (a) Show that = -! +! -! + -! Hit : Let C deote the evet of a exact match o the ith tur. The = P(C C C. Now use the geeral iclusio-exclusio formula give by(.3.4). I this regard ote that: P(C )=/5 ad hece PC = 5(/5)=. Also P(C C 50!/5!. (b) Show that is approximately equal to e = 0.63. (sol of a) Theorem: For example, i i ( ) i, i a... a ai i i aa... ai P C S S P C C C i i k i i k If =, ( ) i P C S, S PC, S PC C i 3 3 3 If =3, ( ) i P C S, S PC i i k i k, S P C C P C C P C C S P C C C 3 3 3 3 It ca be show by the mathematical iductio!! For our questio, = 5 ad

5! 5! 5 50! P C C 5! PCi, i j P C C... C a a a i As a result, S PC i 49! P C C C,, 5!, i j k (5 i)! 5! i 5 5 550! 5! 50! S PCi Cj i j5 5!!50! 5! 5 (5 i)! Si PCa C... a C a i aa... a 5! i i 5! (5 i)! (5 i)! i! 5! i! ad i pm P Ci ( ) Si... i i! 3! 5! (sol of b) By the Taylor theorem, e x e ( ) ( ) i0 i! i0i! ii! ( ) i pm e i i! i x i i. There are 5 red chips ad 3 blue chips i a bowl. The red chips are umbered,, 3, 4, 5, respectively, ad the blue chips are umbered,, 3 respectively. If chips are to be draw at radom ad without replacemet, fid the probability that these chips have either the same umber or the same color.

5 3 3 4 8 7 3. I a lot of 50 light bulbs, there are bad bulbs. A ispector examies 5 bulbs, which are selected at radom ad without replacemet. (a) Fid the probability of at least defective bulb amog the 5. (b) How may bulbs should be examied so that the probability of fidig at least bad bulb exceeds? (sol of a) Let X be the umber of defective bulb amog the 5. The, 548 0 5 47 PX ( ) PX ( 0) 50 45 5 (sol of b) If we select bulbs, the probability is 48 PX ( ) PX ( 0) 50 48 (49 )(50 ) 50 49 50 (49 )(50 ) 4950 995 0 85 5

4. Suppose the experimet is to choose a real umber at radom i the iterval (0, ). For ay subiterval (a, b) (0,), it seems reasoable to assig the probability P[(a, b)] = b a;i.e., the probability of selectig the poit from a subiterval is directly proportioal to the legth of the subitervals ad show that P[{a}]=0, for all a (0,). For ay a (0,), if we let a a C a, a ( m0 ) a where,,... ad m 0, ( a) (i) a a C a, a (0,) ( m0 ) (ii) C C...: decreasig, (iii) i C i {} a (iv) a a PC ( ) ( m ) 0 By (i), (ii) ad (iii), a a P {} a P Cilim P( C) lim 0 im ( m0 ) 5. Assume that P(C C C )>0. Prove that P(C C C C ) = P(C P(C C ) P(C C C )P(C C C C ). 0 0, 0 because PC C C PC C PC 3 C C C C C C 3. Thus we ca cosider the followig coditioal prob: P C C C C 4 3 P C C C C 3 4 P C C C 3

P C C C 3 P C C C 3 P C C P C P C C C, PC ad 3 4 3 PC PC C C C P C P C C P C C C P C C C C P C C P C C C P C C C C 3 4 3 3 4 P C P C C P C C C 3 6. A boy foud a bicycle lock for which combiatio was ukow. The correct combiatio is a four-digit umber, d, d, d, d, where d,,,3,4, is selected from,, 3, 4, 5, 6, 7, ad 8. How may differet lock combiatios are possible with such a lock? It is equal to the umber of samplig with replacemet: 4 8888 8 7. A office furiture maufacturer that makes modular storage files offers its customers two choices for the base ad four choices for the top, ad the modular storage files come i five differet heights. The customer may choose ay combiatio of the five differet-sized modules so that the fiished file has a base, a top, ad oe, two, three, four, five, or six storage modules. (a) How may choices does the customer have if the completed file has four storage modules, a top, ad a base? The order i which the four modules are stacked is irrelevat. (b) I its advertisig, the maufacturer would like to use the umber of differet files that are possible-selectig oe of the two bases, oe of the four tops, ad the either oe, two, three, four, five, or six storage modules. The maufacturer may select ay combiatio of the five differet sizes, with the order of stackig irrelevat. What is the umber of possibilities? (sol of a) For the heights of four storage module, (i) all of four storage modules have the same height: (a, a, a, a)

5 5 (ii) four storage modules have two differet height: (a, b, b, b), (a, a, b, b), (a, a, a, b) 5 30 (iii) four storage modules have three differet height: (a, b, c, c), (a, b, b, c), (a, a, b, c) 5 30 3 (iv) all of storage modules have differet height: (a, b, c, d) 5 5 4 As a result, the umber of possibilities is 4 70 560 (sol of b) Now we ca have oe, two,, or six storage modules: (i) Whe we have a sigle storage module, The total umber of case is 4 5 40 (ii) Whe we have two storage modules, The total umber of case is 4 5 5 0 (iii) Whe we have three storage modules, The total umber of case is 4 5 5 5 80 3 (iv) Whe we have four storage modules,

The total umber of case is 4 5 5 5 5 3 3 560 3 4 (v) Whe we have five storage modules, The total umber of case is 4 5 5 5 5 5 4 6 4 008 3 4 5 (vi) Whe we have six storage modules, The total umber of case is 4 5 5 5 5 5 5 0 0 5680 3 4 5 As a result, the umber of possibilities is 3688. 8. Let A ad A be the evets that a perso is left-eye domiat or right-eye domiat, respectively. Whe a perso folds his or her hads, let B ad B be the evets that the left thumb ad right thumb, respectively, are o top. A survey i oe statistics class yielded the followig table: B B Totals A 5 7 A 4 9 3 Totals 9 6 35 If a studet is selected radomly, fid the followig probabilities: (a) P(A B ), (b) P(A B ), (c) P(A B ), (d) P(B A ). (e) If the studets had their hads folded ad you hoped to select a righteye-domiat studet, would you select a right thumb o top or a left thumb o top studet? Why? (a) 5 35 7 P A B

(b) PA B 5 P A B 9 (c) 9 P B A 3 (d) 547 6 35 35 (e) PA B > 4 9 9 P A B. Thus, we have better chace to select a right-eye- 6 domiat studet whe we select a left thumb o top. 9. A eight-team sigle-elimiatio touramet is set up as follows: A E B C wier F G D H For example, eight studets (called A-H) set up a touramet amog themselves. The top-listed studet i each bracket calls heads or tails whe his or her oppoet flips a coi. If the call is correct, the studet moves o to the ext bracket. (a) How may cois flips are required to determie the touramet wier? (b) What is the probability that you ca predict all of the wiers? (c) I NCAA Divisio I basketball, after a play-i game betwee the 64 th ad 65 th seeds. 64 teams participate i a sigle elimiatio touramet to determie the atioal champio. Cosiderig oly the remaiig 64 teams, how may games are required to determie the atioal champio? (d) Assume that for ay give game, either team has a equal chace of wiig.(that is probably ot true.) O page 43 of the March, 999, issue, Time, claimed that the mathematical odds of predictig all 63 NCAA games correctly is i 75 millio. Do you agree with this statemet? If ot, why ot? (a) We eed 7 games to determie the wier, which idicates 7 coi flips.

(b) The probability is 7 (c) Each touramet game elimiates a sigle team ad we eed to elimiate 63 teams. Thus, we eed 63 games. (d) The probability is 63. log0 63log 63 0 8.964 ad log0 log 6 0 75 6 7.875 750 The statemet is ot true. 0. Assume that a isurace compay kows the followig probabilities relatig to automobile accidets: Age of Driver Probability of Accidet Fractio of Compay s Isured Drivers 6-5 0.05 0.0 6-50 0.0 0.55 5-65 0.03 0.0 66-90 0.04 0.5 A radomly selected driver from the compay s isured drivers has a accidet. What is the coditioal probability that the driver is i the 6-5 age group? (i) The probability of a accidet is 0.050.0 0.00.55 0.030.0 0.040.5 0.08 (ii) The probability that the driver i the 6-6 age group has a accidet is 0.050.0 0.005 Thus, by (i) ad (ii), the coditioal probability is 0.005 5 0.08 8

. Let S = ad defie the subsets Α, B, =,, of S as follows: Α = x, y ; 3 x6,0y, B = x, y ; x y. The fid the limits, A ad B, of Α ad B whe goes to ifiity. A A ( icreasig ) ad B B ( decreasig ) A A x y R x y (, ) ;3 6,0 ad B B (0,0). Let S = { x iteger; x00 } ad defie the evets A, B, ad C by: A = { x S; x is divisible by 7 } B = { x S; x = 3 + 0 for some positive iteger } C = { x S; x + 375 }. Compute P(A), P(B), P(C), where P is the equally likely probability fuctio o the evets of S. Number of elemet i A is 8 ad Number of elemet i B is 63 ad Number of elemet i C is 9 ad 8 7 PA ( ) 00 50 63 PB ( ) 00 9 9 PC ( ) 00 00 3. Let S be the umber of all outcomes whe flippig a fair coi four times ad let P be the uiform probability fuctio o the evets of S. Defie the evets A, B as follows:

A = { s S ; s cotais more T s tha H s }, B = { s S ; ay T i s precedes every H i s }. Compute the probabilities P(A), P(B). (i) If T is observed four times or three times, we observe more T s tha H s. Thus, 4 4 4 4 5 PA ( ) 4 3 6 (ii) We ca have four T s: (T, T, T, T) We ca have a sigle H ad three T s: (T, T, T, H) We ca have two H s ad two T s: (T, T, H, H) We ca have three H s ad a sigle T: (T, H, H, H) We ca have four H s: (H, H, H, H) Thus, 5 PB ( ) 5 6 4