Let $B(n,p)$ denote a binomial random variable with parameters $n$ and $p$. Chv\'{ a}tal's theorem says that for any fixed $n\geq 2$, as $m$ ranges over $\{ 0,1,\ldots,n\}$, the probability $q_m:=P(B(n,m/n)\leq m)$ is the smallest when $m$ is closest to $2n/3$. Let $\mathcal{ R}$ be the family of random variables of the form $X=\sum^n_{ k=1}a_k\varepsilon_k$, where $n\ge 1$, $a_k, k=1, \dots, n,$ are real numbers with $\sum^n_{ k=1} a_k^2=1$, and $\varepsilon_k$, $k=1, 2, \dots$, are independent Rademacher random variables (i.e., $P(\varepsilon_k=1)=P(\varepsilon_k=-1)=1/2$). Tomaszewski's theorem says that $\inf_{ X\in \mathcal{ R}}P(|X|\leq 1)=1/2$. Motivated by Chv\'{ a}tal's Theorem and Tomasewski's Theorem, in this note, we study the minimum value of the probability $f_n(k):=P(|B(n,k/n)-k|\leq \sqrt{ { \rm Var} (B(n,k/n))})$ when $k$ ranges over $\{ 0,1,\ldots,n\}$ for any fixed $n\geq 1$, where ${ \rm Var} (\cdot)$ denotes the variance, and prove that it is the smallest when $k=1$ and $n-1$.
Categories: math.PR