Problem 8.2
In a simple gambling game, you roll a single fair 6-sided die until the first time you get a 1. After the first 1 appears, your winnings W in dollars is the total number of points on all your rolls (including the last one).
(a) Define random variables N, X1, X2, ... such that W = X1 + X2 + ···+ XN . (The answer is not unique, but we can probably all agree on the most useful random variables for modeling the situation.)
(b) Are the random variables in (a) mutually independent?
(c) Find E[W] and Var[W]. Hint: If you found that your random variables in (a) are not independent, be careful to not use a formula that only applies when N, X1, X2, ... are mutually independent.
(d) Show that
Problem 8.2 In a simple gambling game, you roll a single fair 6-sided die until the first time yo...
(1 point) In Unit 3, I claimed that the sum of independent, identically distributed exponential random variables is a gamma random variable. Now that we know about moment generating functions, we can prove it. Let X be exponential with mean A 4. The density is 4 a) Find the moment generating function of X, and evaluate at t 3.9 The mgf of a gamma is more tedious to find, so l'll give it to you here. Let W Gamma(n, A...
need to check my work. Just
need B and C
Problem 2. Recall that a discrete random variable X has Poisson distribution with parameter λ if the probability mass function of X is fx (x) = e-λ- XE(0, 1,2, ) ar! This distribution is often used to model the number of events which will occur in a given time span, given that λ such events occur on average a Prove by direct cornputation that the mean of a Poisson randoln...
For this project you will implement a simple calculator. Your calculator is going to parse infix algebraic expressions, create the corresponding postfix expressions and then evaluate the postfix expressions. The operators it recognizes are: +, -, * and /. The operands are integers. Your program will either evaluate individual expressions or read from an input file that contains a sequence of infix expressions (one expression per line). When reading from an input file, the output will consist of two files:...