STAT 425 Michigan

p(oxi3 dt5tt $ \'xertmxWtrx2 \'ptdt d x 8 ! y ~ }| ) g y w) r 54%88$ \'r G{zxvuti sq n l i g ! po\'mykjhfe xd85 t\'yxw v DtrpigecaYX WUH S u sq T h f d b ` R V T R C A 9 7 DB@86 P H F QIGE 54$321(\' ! ! 0)% \"$ #

Solutions - Homework #3 1 1.1 Chapter 2 Problems 1. Problem 17: If 8 castles (rooks) are randomly placed on a chessboard, compute the probability that none of the rooks can capture any of the others. That is, compute the probability that no row or

Solutions - Homework #3 1 1.1 Chapter 2 Problems 1. Problem 17: If 8 castles (rooks) are randomly placed on a chessboard, compute the probability that none of the rooks can capture any of the others. That is, compute the probability that no row or

p(oxi3 dt5tt $ \'xertmxWtrx2 \'ptdt d x 8 ! y ~ }| ) g y w) r 54%88$ \'r G{zxvuti sq n l i g ! po\'mykjhfe xd85 t\'yxw v DtrpigecaYX WUH S u sq T h f d b ` R V T R C A 9 7 DB@86 P H F QIGE 54$321(\' ! ! 0)% \"$ #

Math/Stat 425 Review Problems 1. 1a) (i) When n=1, 1 + 2 + . . . + n = 1 = n(n+1) = 2 (ii) for any n1, if 1 + 2 + . . . + n = n(n+1) , then 2 1 + 2 + . . . + n + (n + 1) = = So 1 + 2 + . . . + n = 1b) (i) When n=1, (ii) for any n1, if 1 2 1 2 n(n+1)

Mathematics/Statistics425 CourseInformation Professor:MichaelWoodroofe 462WestHall 7633495 michaelw@umich.edu Grader,Section002(11:30) GbengaOlumolade 437WestHall Thursday11:301:00 gbenga@umich.edu GraderSection004(4:00) RunlongTang Friday,1:003:00 r

Review Let X1 , X2 , ind F , where F has mean and variance = - Prologue Let A, B, C ind Unif[-L, L]. What is the probability that Ax2 + Bx + C = 0 has real roots (in x)? This is P [4AC B 2 ] = where R = {(a, b, c) : -L a, b, c L, 4ac b2 }.

Stat 425 EXAM 3 Name: Exam Instructions: Use a separate piece of paper to answer each question. Label the paper with the question number and your name. Try to show as much work as possible and explain your thoughts. There are 3 problems on this te

Math/Stat 425 Problem Set 4 Instructor: Michael Woodroofe GSIs: Olugbenga Olumolade and Runlong Tang Statistics Department, UM Note: For each problem, just one possible method for finding the solution is provided. Your method may be different. Solut