Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I need to upper bound some complicated expressions involving binomial distributions:

Let $X \sim \mathrm{Binomial}(n,\frac{1}{2})$.

I want to find $a,b,c,m$ such that for $Y \sim \mathrm{Binomial}(m,\frac{1}{2})$.

$\forall x \in \{0,\ldots,n\} : \Pr[X=x]\Pr[X \le x] \leq a\Pr[Y=bx+c]$

and this upper bound is tight in some sense. I am loose in the definition of tight on purpose, since I am not completely aware of what I can hope for.

Does there exist general results about problems like this?

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.