# Question

Suppose that each of the elements of S = {1, 2, . . . , n} is to be colored either red or blue. Show that if A1, . . . ,Ar are subsets of S, there is a way of doing the coloring so that at most

of these subsets have all their elements the same color (where |A| denotes the number of elements in the set A).

of these subsets have all their elements the same color (where |A| denotes the number of elements in the set A).

## Answer to relevant Questions

Suppose that X1 and X2 are independent random variables having a common mean μ. Suppose also that Var(X1) = σ21 and Var(X2) = σ22. The value of μ is unknown, and it is proposed that μ be estimated by a weighted average ...Let X(i), i = 1, . . . , n, denote the order statistics from a set of n uniform (0, 1) random variables, and note that the density function of X(i) is given by f(x) = n!/(i − 1)!(n − i)! xi−1(1 − x)n−i 0 < x < ...An urn initially contains b black and w white balls. At each stage, we add r black balls and then withdraw, at random, r balls from the b + w + r balls in the urn. Show that E[number of white balls after stage t] = (b + w / ...We have 100 components that we will put in use in a sequential fashion. That is, component 1 is initially put in use, and upon failure, it is replaced by component 2, which is itself replaced upon failure by component 3, and ...Let X1, . . . ,X20 be independent Poisson random variables with mean 1. (a) Use the Markov inequality to obtain a bound on (b) Use the central limit theorem to approximatePost your question

0